Skip Navigation

Logic Journal of IGPL 1995 3(6):921-937; doi:10.1093/jigpal/3.6.921
© 1995 by Oxford University Press
This Article
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 WALLACE, K.
Right arrow Articles by WRIGHTSON, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Regressive Merging in Model Elimination Tableau-Based Theorem Provers

KEVIN WALLACE and GRAHAM WRIGHTSON

Department of Computer Science, University of Newcastle NSW 2308, Australia E-mail:kevin.graham{at}cs.newcastle.edu.au

Theorem provers based on model elimination are among the weakest proof systems with respect to redundancy control and proof compactness. In this paper we present regressive merging, a technique to dramatically increase the inferential power of model elimination tableau systems by encapsulating and reusing information obtained during construction of the proof. Using results from the theorem prover Bluegum, we demonstrate the startling effectiveness of the technique on a representative set of propositional problems from the literature.


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.