105 search results - page 9 / 21 » Optimal Proof Systems for Propositional Logic and Complete S... |
CORR
2010
Springer
13 years 4 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...
LICS
2003
IEEE
14 years 20 days ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
FUIN
2007
13 years 7 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
PRICAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...