Abstract
In recent years interesting decidability results for syntactically specified classes of clause sets have been achieved by employing resolution as a decision procedure. We extend this line of research by considering also clauses with equality literals. We use a special version of ordered paramodulation and resolution to decide a class of clause sets that corresponds to an extension of the Ackermann class with equality (i.e., prenex formulas with prefixes of type ∃*∀∃*). By encoding Turing machines we also show that slight modifications of the defining conditions for this class lead to undecidability.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Bachmair, H. Ganzinger, and U. Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In Third Kurt Gödel Colloquium 1993, LNCS. Springer-Verlag, 1993. To appear.
B. Dreben and W. D. Goldfarb. The Decision Problem. Addison-Wesley, 1979.
C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. LNCS. Springer-Verlag, 1993. To appear.
G. Gottlob and C. Fermüller. Removing redundancy from a clause. J. Artificial Intelligence, 1993. To appear.
W. D. Goldfarb. The unsolvability of the Gödel class with identity. JSL, 49:1237–1252, 1984.
Y. Gurevich. Formuly s odnim ∀ (formulas with one ∀). In Izbrannye Voprosy Algebry i Logiki (Selected Questions in Algebra and Logic—in Memory of A. Mal'cev), pages 97–100. Nauka, Novosibirsk, 1973.
J. Hsiang and M. Rusinowitch. Proving refutational completeness of theorem-proving strategies: The transfinite semantic tree method. JACM, 38(3):559–587, 1991.
W. H. Joyner. Resolution strategies as decision procedures. JACM, 23(1):398–417, 1976.
M. Rusinowitch. Theorem-proving with resolution and superposition. JSC, 11:21–49, 1991.
P. van Emde Boas. Machine models and simulations. In Jan van Leeuwen, editor, Algorithms and Complexity, Handbook of Theoretical Computer Science, Vol. A, pages 1–66. Elsevier, 1990.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fermüller, C., Salzer, G. (1993). Ordered paramodulation and resolution as decision procedure. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_47
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive