Abstract
We describe an extension of Stålmarck’s method in First Order Logic. Stålmarck’s method is a tableaux-like theorem proving method for propositional logic, that uses a branch-and-merge rule known as the dilemma rule. This rule opens two branches and later merges them, by retaining their common consequences. The propositional version does this with normal set intersection, while the FOL version searches for pairwise unifiable formulae from the two branches. The proof procedure attempts to find proofs with as few simultaneously open branches as possible. We present the proof system and a proof procedure, and show soundness and completeness. We also present benchmarks for an implementation of the proof procedure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baumgartner, P., Tinelli, C.: The Model Evolution Calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)
Björk, M.: Extending Stålmarck’s Method to First Order Logic. TABLEAUX 2003 Position Papers and Tutorials, 23–36 (2003)
Björk, M.: Stålmarck’s Method for Automated Theorem Proving in First Order Logic. Licentiate Thesis (2003), http://www.cs.chalmers.se/~mab
Björk, M.: Adding Equivalence Classes to Stålmarck’s Method in First Order Logic. Doctoral Programme of IJCAR 2004, CEUR workshop proc., ISSN 1613-0073, Vol 106 (2004)
D’Agostino, M., Mondadori, M.: The Taming of the Cut. Journal of Logic and Computation 3(4), 285–319 (1994)
Fitting, M.C.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, New York (1996)
Lundgren, L.: Stålmarck’s Method in FOL. Master’s th., Chalmers University (1999)
Robinson, G., Wos, L.: Paramodulation and theorem-proving in first-order theories with equality. In: Machine Intelligence, vol. 4, Edinburgh U. Press (1969)
Sheeran, M., Stålmarck, G.: A Tutorial On Stålmarck’s Proof Procedure for Propositional Logic. Formal Methods in System Design 16(1), 23–58 (2000)
CADE ATP System Competition (CASC), organized by Geoff Sutcliffe. (2004), http://www.cs.miami.edu/~tptp/CASC/J2
Thousands of Problems for Theorem Provers, http://www.cs.miami.edu/~tptp/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Björk, M. (2005). A First Order Extension of Stålmarck’s Method. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_20
Download citation
DOI: https://doi.org/10.1007/11591191_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30553-8
Online ISBN: 978-3-540-31650-3
eBook Packages: Computer ScienceComputer Science (R0)