Abstract
Horn Clauses are formulae of first order predicate calculus <189> of the form:
where each of the Ai and A are atomic formulae i.e. of the form R(C1.....Cn), where R is a relation, each Cj is a term, and n ≥. 0.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chang, C. C. and Keisier, H.J. Model Theory. North-Holland, 1973.
Kowaiski, R. A. Logic for problem solving. North-Holland, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Horn Clauses. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_97
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive