Sciweavers

479 search results - page 25 / 96
» A quantified logic of evidence
Sort
View
SLOGICA
2008
99views more  SLOGICA 2008»
13 years 6 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
IJCAI
1989
13 years 9 months ago
The Logic of Time Structures: Temporal and Nonmonotonic Features
We Imbed Into a first order logic a representation language that combines atemporal knowledge with time stamps in a hierarchical fashion. Each time structure contains its own chro...
Mira Balaban, Neil V. Murray
CADE
2005
Springer
14 years 8 months ago
sKizzo: A Suite to Evaluate and Certify QBFs
We present sKizzo, a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by means of propositional skolemization and symbolic reasoning.
Marco Benedetti
IJCAI
2001
13 years 9 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
JSYML
2002
170views more  JSYML 2002»
13 years 7 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason