Skip Navigation


Journal of Logic and Computation Advance Access originally published online on November 21, 2008
Journal of Logic and Computation 2009 19(2):263-302; doi:10.1093/logcom/exn073
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bofill, M.
Right arrow Articles by Rubio, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Corner Article

Paramodulation with Well-founded Orderings

Miquel Bofill

Universitat de Girona, Department IMA, Girona, Spain.
E-mail: mbofill{at}ima.udg.edu

Albert Rubio

Universitat Politècnica de Catalunya, Department LSI, Barcelona, Spain.
E-mail: rubio{at}lsi.upc.edu

Received 18 January 2008.

For many years, all existing completeness results for Knuth–Bendix completion and ordered paramodulation required the term ordering {succeeds} to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By using a new restricted form of rewriting, we obtain a completeness proof of ordered paramodulation for Horn clauses with equality, where well-foundedness of the ordering suffices. Apart from the theoretical significance of this result, some potential applications motivating the interest of dropping the subterm property are given. The proof of the results included in this article, being still technical in some parts, is pretty much shorter and easier to read than the one we have in the preliminary version of this work presented at the CADE, 2002 conference (Bofill, and Rubio, 2002, CADE, Vol. 2392 of LNAI, pp. 456–470).

Keywords: Term rewriting; equational reasoning; theorem proving; paramodulation; Knuth–Bendix completion



References

  1. Bachmair L, Dershowitz N. Equational inference, canonical proofs, and proof orderings. Journal of the ACM (1994) 41:236–276.[CrossRef][Web of Science]
  2. Bachmair L, Dershowitz N, Hsiang J. Orderings for equational proofs. (1986) Los Alamitos, CA, Cambridge, MA, USA. IEEE Computer Society Press. 346–357. In Proceedings of the First IEEE Symposium on Logic in Computer Science (LICS).
  3. Bachmair L, Ganzinger H. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation (1994) 4:217–247.[Abstract/Free Full Text]
  4. Bachmair L, Ganzinger H. Equational reasoning in saturation-based theorem proving. In. In: Automated Deduction — A Basis for Applications—Bibel W, Schmitt P, eds. (1998) I. Dordrecht, The Netherlands: Kluwer. 353–397. Chapter 11.
  5. Bachmair L, Ganzinger H, Lynch C, Snyder W. Basic paramodulation. Information and Computation (1995) 121:172–192.[CrossRef][Web of Science]
  6. Bofill M, Godoy G, Nieuwenhuis R, Rubio A. Paramodulation with non-monotonic orderings. (1999) Los Alamitos, CA, USA: IEEE Computer Society Press. 225–233. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science (LICS) Trento, Italy.
  7. Bofill M, Godoy G, Nieuwenhuis R, Rubio A. Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings. Journal of Automated Reasoning (2003) 30:99–120.[CrossRef][Web of Science]
  8. Bofill M, Rubio A. Well-foundedness is sufficient for completeness of ordered paramodulation. (2002) Berlin Heidelberg, Germany. Springer-Verlag. 456–470. In Proceedings of the 18th International Conference on Automated Deduction (CADE), Vol. 2392 of Lecture Notes in Artificial Intelligence, Copenhagen, Denmark.
  9. Bofill M, Rubio A. Redundancy notions for paramodulation with non-monotonic orderings. (2004) Berlin Heidelberg, Germany: Springer-Verlag. 107–121. In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR), Vol. 3097 of LNAI Cork, Ireland.
  10. Dershowitz N, Jouannaud J-P. Rewrite systems. In. In: Handbook of Theoretical Computer Science, Formal Models and Semantics—van Leeuwen J, ed. (1990) B. Cambridge, MA, USA: Elsevier Science B.V, Amsterdan, The Netherlands and The MIT Press. 244–320. Chapter 6.
  11. Hsiang J, Rusinowitch M. Proving refutational completeness of theorem proving strategies: the transfinite semantic tree method. Journal of the ACM (1991) 38:559–587.[Web of Science]
  12. Marché C. On ground AC-completion. (1991) Berlin Heidelberg, Germany: Springer-Verlag. 411–422. In Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA), Vol. 488 in LNCS Como, Italy.
  13. Narendran P, Rusinowitch M. Any ground associative commutative theory has a finite canonical system. (1991) Berlin Heidelberg, Germany: Springer-Verlag. 423–434. In Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA), Vol. 488 in LNCS, Como, Italy.
  14. Narendran P, Rusinowitch M. The unifiability problem in ground AC theories. (1993) Los Alamitos, CA, USA: IEEE Computer Society Press. 364–370. In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (LICS) Montreal, Canada.
  15. Nieuwenhuis R, Rubio A. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation (1995) 19:321–351.[CrossRef][Web of Science]
  16. Nieuwenhuis R, Rubio A. Paramodulation with built-in AC-theories and symbolic constraints. Journal of Symbolic Computation (1997) 23:1–21.[CrossRef][Web of Science]
  17. Nieuwenhuis R, Rubio A. Paramodulation-based theorem proving. In. In: Handbook of Automated Reasoning—Robinson J, Voronkov A, eds. (2001) 1. Cambridge, MA, USA: Elsevier Science B.V, Amsterdan, The Netherlands and The MIT Press. 372–444. Chapter 7.
  18. Rubio A, Nieuwenhuis R. A total AC-compatible ordering based on RPO. Theoretical Computer Science (1995) 142:209–227.[CrossRef][Web of Science]
  19. Rusinowitch M, Vigneron L. Automated deduction with associative commutative operators. Journal of Applicable Algebra in Engineering, Communication and Computation (1995) 6:23–56.[CrossRef]
  20. Wechler W. Universal algebra for computer scientists. In. In: EATCS Monographs on Theoretical Computer Science—Rozenberg G, Salomaa A, Brauer W, eds. (1992) 25. Berlin, Heidelberg, Germany: Springer.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bofill, M.
Right arrow Articles by Rubio, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?