4 search results - page 1 / 1 » A Model-Based Completeness Proof of Extended Narrowing and R... |
CADE
2001
Springer
13 years 9 months ago
2001
Springer
AAAI
2010
13 years 6 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...