103 search results - page 3 / 21 » Proof Systems for Effectively Propositional Logic |
106
click to vote
AAAI
2008
15 years 1 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
CLIMA
2007
15 years 23 days ago
2007
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
100
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...