Abstract
In this paper we consider a few simple classes of definite programs and goals and study the problem of deciding whether a given goal has a successful SLD-derivation (the SUCCESS problem). Although the problem is always decidable for the classes studied, it turns out to be NP-complete even for some very simple classes.
The transition between two specific classes of pairs of logic programs and goals (classes C2 and C3) is studied in detail by considering a number of intermediate classes. Some of these belong to the complexity class P while others are NP-Complete. This transition seems to be quite “erratic” in the sense that there is apparently no simple property of the class in consideration that corresponds to NP-hardness.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Amihud and Y. Choueka. Loop programs and polinomially computable functions. International Journal of Computer Mathematics, Section A, 9:195–205, 1981.
John C., Cherniavsky. Simple programs realize exactly Presburger formulas. SIAM Journal on Computing, 5:666–677, 1976.
Arthur Delcher and Simon Kasif. Some results on the complexity of exploiting data dependency in parallel logic programs. Journal of Logic Programming, 6:229–241, 1989.
Thomas Eiter and Georg Gottob. Complexity results for logic-based abdunction. In Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic programming, pages 438–449, Washigton DC, 1992.
Michael Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
Frank Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
C. A. R. Hoare and D. C. S. Allison. Incomputability. Computing Surveys, 4:169–178, 1972.
A. Meyer and D. Ritchie. The complexity of loop programs. In Proceedings of the 22nd National Conference of the ACM, pages 465–469, Washington, 1967.
John Schlipf. The expressive power of the logic programming semantics. Technical Report CIS-TR-90-3, Computer Science Departement, University of Cincinnati, 1990.
John Schlipf. A survey of complexity and undecidability results in logic programming. Technical Report CIS-TR-92-4, Computer Science Departement, University of Cincinnati, 1992.
L. J. Stockmeyer. The polynomial hierarchy. Theoretical Computer Science, 3:1–22, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matos, A.B. (1993). Some results on the complexity of SLD-derivations. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_45
Download citation
DOI: https://doi.org/10.1007/3-540-57287-2_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57287-9
Online ISBN: 978-3-540-48036-5
eBook Packages: Springer Book Archive