Abstract
Several extensions of the logic programming language Prolog to non-Horn clauses use case analysis to handle non-Horn clauses. In this paper, we present analytical and empirical evidence that, by making a set of clauses less “non-Horn” using predicate renaming, the performance of these case-analysis based procedures can be improved significantly. In addition, we will investigate the problem of efficiently constructing a predicate renaming that reduces the degree of “non-Hornness” of a clause set by the maximum. We will show that the problem of finding a predicate renaming to achieve minimal “non-Hornness” is NP-complete.
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
P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, Journal of Automated Reasoning 13 339–359 (1994).
W.F. Clocksin and C.S. Mellish, Programming in Prolog, Springer-Verlag (1981).
M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H.Freeman and Company (1979).
L. Henschen and L. Wos, Unit refutations and Horn sets, Journal of ACM 21 (4) (1974) 590–605.
J.W. Lloyd, Foundations of logic programming, Springer-Verlag (1987).
R.A. Kowalski, Predicate logic as a programming language, Information Processing, pp. 569–574, North Holland, Stockholm (1974).
H.R. Lewis, Renaming a set of clauses as a Horn set, Journal of ACM 25 (1) (1978) 134–135.
D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, Journal of ACM 16 (3) 349–363 (1969).
D.W. Loveland, Near-Horn Prolog and beyond, Journal of Automated Reasoning 7 (1) 1–26 (1991).
H. Mannila and K. Mehlhorn, A fast algorithm for renaming a set of clauses as a Horn set, Information Processing Letter 21 269–272 (1985).
D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, Proceeding of AAAI-92, pp. 459–465 (1992).
X. Nie, Complexities of non-Horn clause logic programming, Methodologies for Intelligent Systems 5, Z. Ras, M. Zemankova, and M. Emrich, eds. 539–544 (North-Holland, 1990)
X. Nie, How well are non-Horn clauses handled, 6th International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Computer Science 542, 580–588 (Springer-Verlag, 1991).
X. Nie, A note on non-Horn clause logic programming, Artificial Intelligence, in press.
D.A. Plaisted, A simplified problem reduction format, Artificial Intelligence 18 227–261 (1982).
D.A. Plaisted, Non-Horn clause logic programming without contrapositives, Journal of Automated Reasoning 4 (3) (1988) 287–325.
D.W. Reed and D.W. Loveland, A comparison of three Prolog extensions, Journal of Logic Programming 12 25–50 (1992).
D. W. Reed and D.W. Loveland, Near-Horn Prolog and the ancestry family of procedures, Annals of Mathematics and Artificial Intelligence 14 (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nie, X., Guo, Q. (1997). Renaming a set of non-horn clauses. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1997. Lecture Notes in Computer Science, vol 1325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63614-5_58
Download citation
DOI: https://doi.org/10.1007/3-540-63614-5_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63614-4
Online ISBN: 978-3-540-69612-4
eBook Packages: Springer Book Archive