Unit propagation in a tableau framework

Authors:
Gernot Stenz
Affiliations:
Institut für Informatik, Technische Universität München, Garching, Germany
Venue:
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2005

Citing 5
Cited 0

A machine program for theorem-proving

Communications of the ACM
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Simplification: A General Constraint Propagation Technique for Propositional and Modal Tableaux

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
DCTP 1.2 - System Abstract

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
System Abstract: E 0.61

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We show a way of integrating a variant of unit propagation into the disconnection calculus and present some results obtained with an implementation of unit propagation in the DCTP theorem prover that show the usefulness of our new method.