Partition-based logical reasoning for first-order and propositional theories
- 15 December 2004
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 162 (1-2), 49-88
- https://doi.org/10.1016/j.artint.2004.11.004
Abstract
No abstract availableKeywords
This publication has 63 references indexed in Scilit:
- OR-parallel theorem proving with random competitionPublished by Springer Nature ,2005
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Constructing Craig interpolation formulasPublished by Springer Nature ,1995
- BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.Notre Dame Journal of Formal Logic, 1993
- Linear resolution for consequence findingArtificial Intelligence, 1992
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A basis for deductive database systemsThe Journal of Logic Programming, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985