Skip to main content
SpringerLink
Log in

Horn Clause Logic 1992

  • Conference paper
ALPUK92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

We ask why Horn clause logic is useful for logic programming. The main reasons seem to lie in a connection between Horn clause logic and algebraic closure operators, and in the fact that recursively enumerable sets can be encoded in initial models of Horn clause theories. The existence of good algorithms for handling algebraic closure operators is also important. We review the other main characteristic properties of Horn clause logic, and ask what they are good for in logic programming and more generally in computer science. We make some polemical remarks about generic models, generalisations of Horn clause logic, and the Byrne-Johnson-Laird theory of syllogisms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kuehner D. Some special purpose resolution systems. In: Meltzer B, Michie D (eds) Machine Intelligence. Halsted Press New York, 1972, pp 117–128.

    Google Scholar 

  2. Henschen LJ, Wos L. Unit refutations and Horn sets. JACM 1974; 21:590–605.

    Article  MATH  MathSciNet  Google Scholar 

  3. McKinsey JCC. The decision problem for some classes of sentences without quantifiers. J Symbolic Logic 1943; 8:61–76.

    Article  MATH  MathSciNet  Google Scholar 

  4. Miller D. Abstractions in logic programs. In: Odifreddi P (ed) Logic and Computer Science. Academic Press London, 1990, pp 329–359.

    Google Scholar 

  5. Makowsky JA. Why Horn formulas matter in computer science: initial structures and generic examples. J Comp Sys Sci 1987; 34:266–292.

    Article  MATH  MathSciNet  Google Scholar 

  6. Mal’tsev AI. Quasiprimitive classes of abstract algebras (Russian). Doklady Akad Nauk SSSR 1956; 108:187–189. Translated in Mal’cev AI. The Metamathematics of Algebraic Systems. North-Holland Amsterdam, 1971, pp 27–31.

    Google Scholar 

  7. Reichel H. Initially restricting algebraic theories. In: Dembinski P (ed) Proc. 9th MFCS, Ryszyna, Lecture Notes in Comp Sci 88. Springer Berlin, 1980, pp 504–514.

    Google Scholar 

  8. Colmerauer A. An introduction to Prolog III. In: Lloyd JW (ed) Computational Logic. Springer Berlin, 1990, pp 37–79.

    Chapter  Google Scholar 

  9. Post E. Recursively enumerable sets of positive integers and their decision problems. Bull Amer Math Soc 1944; 50:284–316.

    Article  MATH  MathSciNet  Google Scholar 

  10. Cohn PM. Universal Algebra. Reidel, Dordrecht, 1981.

    Book  MATH  Google Scholar 

  11. Kowalski RA. Logic for Problem Solving. North-Holland, New York, 1979.

    MATH  Google Scholar 

  12. Smullyan RM. On definability by recursion. Bull Amer Math Soc 1956; 62:601.

    Google Scholar 

  13. Chang CL. The unit proof and the input proof in theorem proving. JACM 1970; 17; 698–708.

    Article  MATH  Google Scholar 

  14. Nadathur G, Miller D. Higher-order Horn clauses. JACM 1990; 37:777–814.

    Article  MATH  MathSciNet  Google Scholar 

  15. Grassmann HG. Die lineale Ausdehnungslehre, ein neuer Zweig der Mathematik dargestellt und durch Anwendungen auf die übrigen Zweige der Mathematik, wie auch auf Statik, Mechanik, die Lehre von Magnetismus und die Krystallonomie erläutert. Stettin 1844.

    Google Scholar 

  16. Van Emden MH, Kowalski RA. The semantics of predicate logic as a programming language. JACM 1976; 23:733–742.

    Article  MATH  Google Scholar 

  17. Lloyd JW. Foundations of logic programming. Springer, Berlin, 1984.

    Book  MATH  Google Scholar 

  18. Minker J. On indefinite databases and the closed world assumption. In: Loveland DW (ed) 6th Conference on Automated Deduction. Springer Berlin, 1982, pp 292–308 (Lecture Notes in Comp Sci 138).

    Chapter  Google Scholar 

  19. Shepherdson JC. Negation in logic programming. In: Minker J (ed) Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, 1988, pp 19–88.

    Google Scholar 

  20. Johnson-Laird PN, Byrne RMJ. Deduction. Lawrence Erlbaum Associates, Hove and London, 1991.

    Google Scholar 

  21. Ehrig H, Mahr B. Fundamentals of algebraic specification I. Springer Berlin, 1985.

    Google Scholar 

  22. Tarlecki A. On the existence of free models in abstract algebraic institutions. Theor Comp Sci 1985; 37:269–304.

    Article  MATH  MathSciNet  Google Scholar 

  23. Galvin F. Horn sentences. Ann Math Logic 1970; 1:389–422.

    Article  MATH  MathSciNet  Google Scholar 

  24. Fagin R. Horn clauses and database dependencies. JACM 1982; 29:952–985.

    Article  MATH  MathSciNet  Google Scholar 

  25. Volger H. Preservation theorems for limits of structures and global sections of sheaves of structures. Math Zeitschrift 1979; 166:27–53.

    Article  MATH  MathSciNet  Google Scholar 

  26. Barr M. Models of Horn theories. In: Gray JW, Scedrov A (eds) Categories in Computer Science and Logic. Contemporary Mathematics 92. Amer Math Soc 1989, pp 1–7.

    Google Scholar 

  27. Meinke K. Universal algebra in higher types. Theor Comp Sci (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Queen Mary and Westfield College, Mile End Road, London, E1 4NS, UK

    Wilfrid Hodges

Authors
  1. Wilfrid Hodges
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Midicine, 180 Queen’s Gate, SW7 2BZ, London, UK

    Krysia Broda BSc, MSc, PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Hodges, W. (1993). Horn Clause Logic 1992. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3421-3_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19783-6

  • Online ISBN: 978-1-4471-3421-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation