First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it guides a refinement excluding the previously found unliftable refutation. This way the approach is refutationally complete. We do not step-wise lift refutations but lift conflicting cores, finite unsatisfiable clause sets representing at least one refutation. The approach is dual to many existing approaches in the literature.
KeywordsAutomate Reasoning Horn Clause Ground Instance Lift Step Positive Literal
Unable to display preview. Download preview PDF.
- 2.Giunchiglia, F., Giunchiglia, E.: Building complex derived inference rules: A decider for the class of prenex universal-existential formulas. In: ECAI, pp. 607–609 (1988)Google Scholar
- 4.Hobbs, J.R.: Granularity. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 432–435. Morgan Kaufmann (1985)Google Scholar
- 5.Imielinski, T.: Domain abstraction and limited reasoning. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, vol. 2, pp. 997–1003. Morgan Kaufmann Publishers Inc., San Francisco (1987)Google Scholar
- 8.Newell, A.: Human Problem Solving. Prentice-Hall, Inc., Upper Saddle River (1972)Google Scholar
- 11.Sacerdott, E.D.: Planning in a hierarchy of abstraction spaces. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, IJCAI 1973, pp. 412–422. Morgan Kaufmann Publishers Inc., San Francisco (1973)Google Scholar
- 13.Tenenberg, J.: Preserving consistency across abstraction mappings. In: Proceedings of the 10th IJCAI, International Joint Conference on Artificial Intelligence, pp. 1011–1014 (1987)Google Scholar
- 15.Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, chapter 27, pp. 1965–2012. Elsevier (2001)Google Scholar