Abstract
We prove that a particular superposition based inference operator decides a fragment of clause logic with equality, called OCC1N= g. We also show that the theorem prover SPASS not only implements the corresponding operator but also generates standard descriptions of unique term models for all satisfiable clause sets in OCC1N= g
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994. 117, 117, 117, 125, 128
L. Bachmair, H. Ganzinger, and U. Waldmann. Superposition with simpliffication as a decision procedure for the monadic class with equality. In Proc. of KGC 1993, volume 713 of LNCS. Springer, 1993. 114
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998. 122
R. Caferra and N. Peltier. Decision procedures using model building techniques. In Computer Science Logic, Proc. of CSL’95, volume 1092 of LNCS, pages 130–144. Springer, 1996. 115
C.G. Fermüller and A. Leitsch. Model building by resolution. In Computer Science Logic, Proc. of CSL’92, volume 702 of LNCS, pages 134–148. Springer, 1993. 114, 115, 116
C.G. Fermüller and A. Leitsch. Model building by resolution. Journal of Logic and Computation 6, pages 134–148, 1996. 114, 126, 127, 127, 127
C.G. Fermüller and A. Leitsch. Decision procedures and model building in equational clause logic. Logic Journal of the Interest Group in Pure and Applied Logics (IGPL), 6:17–41, 1998. 114, 114, 114, 126, 127, 127, 127
C.G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution decision procedures. In A. Robinson and A. Vorkonov, editors, Handbook of Automated Reasoning. Elsevier, 2000. To appear. 114
C.G. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer LNAI 679, 1993. 114, 118, 118, 120
C.G. Fermüller and G. Salzer. Ordered paramodulation and resolution as decision procedure. In Proc. of LPAR 1993, volume 698 of LNCS, pages 122–133. Springer, 1993. 114, 116
H. Ganzinger and H. DeNivelle. A superposition decision procedure for the guarded fragment with equality. In Proc. of LICS 1999, pages 295–305. IEEE Computer Society Press, 1999. 114
G. Gottlob and R. Pichler. Working with Arms: Complexity results on Atomic Representations of Herbrand models. In Proc. of LICS 1999, pages 306–315. IEEE Computer Society Press, 1999. 127, 127
F. Jacquemard, C. Meyer, and C. Weidenbach. Unification in extensions of shallow equational theories. In Proc. of RTA 1998, pages 76–90. Springer LNCS 1379, 1998. 114
W. H. Joyner. Resolution strategies as decision procedures. Journal of the ACM, 231:398–417, July 1976. 124
Robert Nieuwenhuis. Basic paramodulation and decidable theories. In Proc. of LICS 1996, pages 437–482. IEEE Computer Society Press, 1996. 114
N. Peltier. Increasing the capabilities of model building by constraint solving with terms with integer exponents. Journal of Symbolic Computation, 24:59–101, 1997. 115, 126
R. Pichler. Algorithms on atomic representations of Herbrand models. In Proc. of JELIA 1998, pages 199–215. Springer LNAI 1489, 1998. 127
R. Pichler. On the complexity of H-subsumption. In Computer Science Logic, Proc. of CSL’98, volume 1584 of LNCS, pages 355–371. Springer, 1998. 127
T. Rudloff. SHR tableaux — a framework for automated model generation. Journal of Symbolic Computation, 2000. To appear. 114
T. Tammet. Resolution Methods for Decision Problems and Finite Model Building. PhD thesis, Department of Computer Science, Chalmers University of Technology., Chalmers-Göteborg, 1992. 126
C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, and D. Topic. System description: SPASS Version 1.0.0. In Proc. of CADE-16, volume 1632 of LNCS, pages 378–382. Springer, 1999. 115, 125
C. Weidenbach. SPASS: Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier, 2000. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fermüller, C.G., Moser, G. (2000). Have SPASS with OCC1N g= . In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-44404-1_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41285-4
Online ISBN: 978-3-540-44404-6
eBook Packages: Springer Book Archive