Extended Horn sets in propositional logic
Journal of the ACM (JACM)
On finding solutions for extended Horn formulas
Information Processing Letters
The arborescence-realization problem
Discrete Applied Mathematics
Journal of the ACM (JACM)
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Incremental Closure of Free Variable Tableaux
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
Depth-first proof search without backtracking for free-variable clausal tableaux
Journal of Symbolic Computation - Special issue: First order theorem proving
| Hi-index | 0.00 |
We present a new proof procedure for first-order logic. It is close in spirit to the usual tableaux-based procedures, but uses a more compact representation of the search space. Roughly speaking, it constructs the tableau from the leaves to the root, and tries to factorize common subtrees when possible.We study the complexity of our procedure for several propositional classes and we show that it is polynomial for all these classes.