On the Completeness of Arbitrary Selection Strategies for Paramodulation
A crucial way for reducing the search space in automated deduction are the so-called selection strategies: in each clause, the subset of selected literals are the only ones involved in inferences.
For first-order Horn clauses without equality, resolution is complete with an arbitrary selection of one single literal in each clause [dN96].
For Horn clauses with built-in equality, i.e., paramodulation-based inference systems, the situation is far more complex. Here we show that if a paramodulation-based inference system is complete with eager selection of negative equations and, moreover, it is compatible with equality constraint inheritance, then it is complete with arbitrary selection strategies. A first important application of this result is the one for paramodulation wrt. non-monotonic orderings, which was left open in [BGNR99].
Unable to display preview. Download preview PDF.
- [BDH86]Leo Bachmair, Nachum Dershowitz, and Jieh Hsiang. Orderings for equational proofs. In First IEEE Symposium on Logic in Computer Science (LICS), pages 346–357, Cambridge, Massachusetts, USA, 1986.Google Scholar
- [BG96]David Basin and Harald Ganzinger. Complexity Analysis Based on Ordered Resolution. In Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS), pages 456–465, New Brunswick, New Jersey, USA, 1996.Google Scholar
- [BGNR99]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, and Albert Rubio. Paramodulation with non-monotonic orderings. In 14th IEEE Symposium on Logic in Computer Science (LICS), pages 225–233, Trento, Italy, 1999.Google Scholar
- [Der91]Nachum Dershowitz. Canonical sets of Horn clauses. In J. Leach Albert, B. Monien, and M. Rodróguez Artalejo, editors, Proceedings of the Eighteenth International Colloquium on Automata, Languages and Programming (ICALP), LNCS 510, pages 267–278, Madrid, Spain, 1991. Springer-Verlag.Google Scholar
- [DJ90]Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pages 244–320. Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo, 1990.Google Scholar
- [DM79]Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Comm. of ACM, 22(8), 1979.Google Scholar
- [dN96]Hans de Nivelle. Ordering refinements of resolution. Dissertation, Technische Universiteit Delft, Delft, 1996.Google Scholar
- [KKR90]Claude Kirchner, Hélène Kirchner, and Michaёl Rusinowitch. Deduction with symbolic constraints. Revue Française d’Intelligence Artificielle, 4(3):9–52, 1990.Google Scholar
- [NR01]Robert Nieuwenhuis and Albert Rubio. Paramodulation-based theorem proving. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers and MIT Press(to appear), 2001.Google Scholar