746 search results - page 48 / 150 » Connectionist Propositional Logic |
166
Voted
CADE
2005
Springer
16 years 8 months ago
2005
Springer
We present sKizzo, a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by means of propositional skolemization and symbolic reasoning.
222
click to vote
SIGSOFT
2003
ACM
16 years 28 days ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
209
Voted
FROCOS
2007
Springer
15 years 11 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
220
click to vote
UAI
1993
15 years 9 months ago
1993
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
188
Voted
RR
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...