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 Full Text (PDF)
Right arrow All Versions of this Article:
19/2/263    most recent
exn073v1
Right arrow References
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.


  Abstract

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


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




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.