As soon as a program is described by a finite automata, one can efficiently verify temporal formulae of various languages (e.g. LTL, CTL,...). However this method requires to fix the different parameters of the program such as the number of processes or resources. Thus this verification is only

This paper presents an attempt of' elaboratlon of a ful] parsing system for Polish natural language which is being worked out in the Institute of Informatics of Warsaw University. Our system was adapted to the pars'ing of the corpus of real medical texts which concern a subdomain of medicine. We made use of the experience of such famous authors as (6), (7), (8), (9), (10), (11), (12), (13), (1)

Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal effectively with large batches of formulas over a common model

We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects

Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general

In this article, a kind of calculus method that is used to determine the truth-values of propositional logic formulae by means of the dynamic neural networks is proposed. The method can be executed mechanically and extended to fuzzy logic system. 1.Preliminaries In classical propositional logic

Model checking based on validating temporal logic formulas has proven practical and e#ective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal e#ectively with large batches of formulas over a common model

The DebateWEL G.U.I. allows two players to exchange logical formulas and enthymemes in a persuasion debate game. DebateWEL protocol, described in [1], ensures consistency of each player with respect to himself and common-knowledge thanks to a SAT solver [2] which is called directly from

Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C-35) to represent relations and formulas. We then show how our new Mu-Calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of linear-time temporal logic formulas

This paper presents a tutorial introduction to the construction of finite-automata on infinite words from linear-time temporal logic formulas. After defining the source and target formalisms, it describes a first construction whose correctness is quite direct to establish, but whose behavior