Talks and Poster Presentations (with Proceedings-Entry):
B. Kiesl, M. Suda:
"A Unifying Principle for Clause Elimination in First-Order Logic";
Talk: CADE 26 - 26th International Conference on Automated Deduction,
- 2017-08-11; in: "Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings",
Lecture Notes in Computer Science / 10395
Preprocessing techniques for formulas in conjunctive normal form play an important role in first-order theorem proving. To speed up the proving process, these techniques simplify a formula without affecting its satisfiability or unsatisfiability. In this paper, we introduce the principle of implication modulo resolution, which allows us to lift several preprocessing techniques---in particular, several clause-elimination techniques---from the SAT-solving world to first-order logic. We analyze confluence properties of these new techniques and show how implication modulo resolution yields short soundness proofs for the existing first-order techniques of predicate elimination and blocked-clause elimination.
theorem proving, first-order logic, sat, preprocessing, clause elimination, resolution
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.