Skip to main content
Springer Nature Link
Log in

Renaming a set of non-Horn clauses

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Several extensions of the logic programming language Prolog to non-Horn clauses use case anlaysis to handle non-Horn clauses. In this paper, analytical and empirical evidences are presented to show 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, the paper also investigated the problem of efficiently constructing a predicate renaming that reduces the degree of “non-Hornness” of a clause set maximally. It is shown that this 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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Clocksin W F, Mellish C S. Programming in Prolog. Springer-Verlag, 1981.

  2. Lloyd J W. Foundations of Logic Programming. Springer-Verlag, 1987.

  3. Kowalski R A. Predicate logic as a programming language. InInformation Processing 74, Jack Rosenfeld (ed.), North-Holland, 1974, pp.569–574.

  4. Baumgartner P, Furbach U. Model elimination without contrapositives and its application to PTTP.Journal of Automated Reasoning, 1994, 13(3): 339–359.

    Article  MathSciNet  Google Scholar 

  5. Loveland D W. A simplified format for the model elimination theorem-proving procedure.Journal of ACM, 1969, 16(3): 349–363.

    Article  MATH  MathSciNet  Google Scholar 

  6. Loveland D W. Near-Horn Prolog and beyond.Journal of Automated Reasoning, 1991, 7(1): 1–26.

    Article  MATH  MathSciNet  Google Scholar 

  7. Plaisted D A. A simplified problem reduction format.Artificial Intelligence, 1982, 18: 227–261.

    Article  MATH  MathSciNet  Google Scholar 

  8. Plaisted D A. Non-Horn clause logic programming without contrapositives.Journal of Automated Reasoning, 1988, 4(3): 287–325.

    Article  MATH  MathSciNet  Google Scholar 

  9. Reed D W, Loveland D W. Near-Horn Prolog and the ancestry family of procedures.Annals of Mathematics and Artificial Intelligence, 1995, 14.

  10. Nie X. Complexities of non-Horn clause logic programming. InMethodologies for Intelligent Systems 5, Ras Z, Zemankova M, Emrich M (eds.), 1990, p.539–544.

  11. Nie X. How well are non-Horn clauses handled. InLecture Notes in Computer Science 542, Ras Z, Zemankova M (eds.), Springer-Verlag, 1991, pp.580–588.

  12. Nie X. A note on non-Horn clause logic programming.Artificial Intelligence, 1997, 92: 243–258.

    Article  MATH  MathSciNet  Google Scholar 

  13. Reed D W, Loveland D W. A comparison of three Prolog extensions.Journal of Logic Programming, 1992, 12: 25–50.

    Article  MATH  MathSciNet  Google Scholar 

  14. Mitchell D, Selman B, Levesque H. Hard and easy distributions of SAT problems. InProceeding of AAAI-92, San Jose, CA, July 12–16, 1992, pp.459–465.

  15. Lewis H R. Renaming a set of clauses as a Horn set.Journal of ACM, 1978, 25(1): 134–135.

    Article  MATH  Google Scholar 

  16. Mannila H, Mehlhorn K. A fast algorithm for renaming a set of clauses as a Horn set.Information Processing Letter, 1985, 21(5): 269–272.

    Article  Google Scholar 

  17. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Company, 1979.

  18. Henschen L, Wos L. Unit refutations and Horn sets.Journal of ACM, 1974, 21(4): 590–605.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wichita State University, 67260, Wichita, Kansas, USA

    Nie Xumin

  2. Department of Computer Science, State University of New York at Albany, 12222, Albany, New York, USA

    Guo Qing

Authors
  1. Nie Xumin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Guo Qing
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Nie Xumin.

Additional information

A preliminary version of this paper was presented at the 10th International Symposium on Methodologies for Intelligence Systems, Charlotte, North Carolina, USA, October 1997.

NIE Xumin was born in 1962. He received his B.S. degree from Harbin Institute of Technology in 1982, his M.S. degree from Temple University in 1985, and his Ph.D. degree from University of North Carolina at Chapel Hill in 1989, all in computer science. He was a research associate at the State University of New York at Albany from 1990 to 1992. He served on the faculty of Wichita State University, Kansas from 1994 to 1997 as an assistant professor. Currently Dr. Nie is on the technical staff of Oracle Corporation. His research interests are in the area of computer system performance, automated reasoning and logic programming.

GUO Qing received his B.S. and M.S. degrees in computer science from the University of Science and Technology of China, in 1985 and 1988, respectively. In 1997 he received the Ph.D. degree in computer science from the State University of New York at Albany. He is currently with GTE Labs, Waltham, Massachusetts. His research interests include automated deduction, telecommunication network management and distributed object computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nie, X., Guo, Q. Renaming a set of non-Horn clauses. J. Comput. Sci. & Technol. 15, 409–415 (2000). https://doi.org/10.1007/BF02950403

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02950403

Keywords