Results 11  20
of
6,753
Parametrized Evaluation Of Temporal Logic Formulae
, 1993
"... 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 part ..."
Abstract
 Add to MetaCart
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
Transformation Of Natural Language Into Logical Formulas
, 1982
"... 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 medici ..."
Abstract
 Add to MetaCart
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)
An Optimizing Compiler for Batches of Temporal Logic Formulas
 In Proceedings of ISSTA’04
, 2004
"... 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. Prese ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
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
Markov Logic Networks
 MACHINE LEARNING
, 2006
"... We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract

Cited by 816 (39 self)
 Add to MetaCart
We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
1 Dynamic neural networks for logic formula
"... In this article, a kind of calculus method that is used to determine the truthvalues 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, the ..."
Abstract
 Add to MetaCart
In this article, a kind of calculus method that is used to determine the truthvalues 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
An Optimizing Compiler for Batches of Temporal Logic Formulas
, 2004
"... 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. Present ..."
Abstract
 Add to MetaCart
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
DebateWEL: An interface for Debating With Enthymemes and Logical formulas ∗
, 2012
"... 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 commonknowledge thanks to a SAT solver [2] which is called directly from the SAToulou ..."
Abstract
 Add to MetaCart
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 commonknowledge thanks to a SAT solver [2] which is called directly from
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Constructing Automata from Temporal Logic Formulas: A Tutorial
 Summer School on Trends in Computer Science, LNCS 2090
"... This paper presents a tutorial introduction to the construction of finiteautomata on infinite words from lineartime 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 is alwa ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
This paper presents a tutorial introduction to the construction of finiteautomata on infinite words from lineartime 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
Results 11  20
of
6,753