Skip to main content

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 10))

  • 51 Accesses

Abstract

We start by presenting some examples of logic programs in the Hornlog system. The body P of a logic program in this system consists of any arbitrary set of Horn clauses over one-sorted Horn clause logic without equality. In chapters 6 through 8 we will examine equational extensions to the Hornlog method which apply to many-sorted Horn clause logic with equality. The procedural interpretation of logic programs [54] is extended so that negative clauses in the body of the logic program are interpreted as negative constraints. That is, ← B 1,..., B m , is interpreted as false ← B 1,..., B m , or “not the case that B 1,...,B m , all hold simultaneously.” The crucial difference between this interpretation and the negation by failure semantics used in Prolog is that in this interpretation any substitutions computed using substitution instances of negative clauses may participate in the construction of the answer substitution. Thus the Hornlog system incorporates a form of classical negation restricted to Horn clauses.

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

Access this chapter

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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer Science+Business Media New York

About this chapter

Cite this chapter

Raatz, S. (1990). A Semantics for the Hornlog System. In: Graph-Based Proof Procedures for Horn Clauses. Progress in Computer Science and Applied Logic, vol 10. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4899-3556-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-3556-4_3

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-0-8176-3530-5

  • Online ISBN: 978-1-4899-3556-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics