Editing Horn clause (section)

== References ==
*{{cite book
|editor-last1= Burris
|editor-first1=Stanley
|editor-last2=Sankappanavar
|editor-first2=H.P.
|year=1981
|url=https://archive.org/details/courseinuniversa00stan
|title=A Course in Universal Algebra
|publisher=Springer-Verlag
|isbn=0-387-90578-2
|url-access=registration
}}
*{{cite book
| last=Buss
| first=Samuel R.
| authorlink = Samuel Buss
| year=1998
| isbn=978-0-444-89840-1
| issn=0049-237X
| editor = Samuel R. Buss
| title=Handbook of Proof Theory
| publisher=Elsevier B.V
| series=Studies in Logic and the Foundations of Mathematics
| volume=137
| contribution=An Introduction to Proof Theory
| pages=1&ndash;78
| contribution-url=http://www.sciencedirect.com/science/article/pii/S0049237X98800165
| doi=10.1016/S0049-237X(98)80016-5
}}
*{{Cite book
| last1=Chang
| first1=Chen Chung
| author-link=Chen Chung Chang
| last2=Keisler
| first2=H. Jerome
| author2-link=Howard Jerome Keisler
| title=Model Theory
| orig-year=1973
| publisher=Elsevier
| edition=3rd
| series=Studies in Logic and the Foundations of Mathematics
| isbn=978-0-444-88054-3
| year=1990
}}
*{{cite journal
|last1=Dowling
|first1=William F.
|last2=Gallier
|first2=Jean H.
|author2-link= Jean Gallier
|year=1984
|title=Linear-time algorithms for testing the satisfiability of propositional Horn formulae
|journal=[[Journal of Logic Programming]]
|volume=1
|number=3
|pages=267–284
|doi=10.1016/0743-1066(84)90014-1|doi-access=free
}}
*{{cite journal
|last1=van Emden
|first1=M. H.
|author-link1=Maarten van Emden
|last2=Kowalski
|first2=R. A.
|author-link2=Robert Kowalski
|year=1976
|url=http://www.doc.ic.ac.uk/~rak/papers/kowalski-van_emden.pdf
|title=The semantics of predicate logic as a programming language
|journal=[[Journal of the ACM]]
|volume=23
|number=4
|pages=733–742
|doi=10.1145/321978.321991|citeseerx=10.1.1.64.9246
|s2cid=11048276
}}
*{{cite journal
|last=Horn
|first=Alfred
|author-link=Alfred Horn
|year=1951
|title=On sentences which are true of direct unions of algebras
|journal=[[Journal of Symbolic Logic]]
|pages=14–21
|volume=16
|number=1
|doi=10.2307/2268661|jstor=2268661
|s2cid=42534337
}}
*{{cite book
|last1=Lau
|first1=Kung-Kiu
|last2=Ornaghi
|first2=Mario
|year=2004
|title=Program Development in Computational Logic
|chapter=Specifying Compositional Units for Correct Program Development in Computational Logic
|series=Lecture Notes in Computer Science
|volume=3049
|pages=1–29
|doi=10.1007/978-3-540-25951-0_1
|isbn=978-3-540-22152-4
}}
*{{cite journal
|last=Makowsky
|first=J.A.
|author-link=Johann Makowsky
|year=1987
|url=https://core.ac.uk/download/pdf/82190596.pdf
|title=Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples
|journal=[[Journal of Computer and System Sciences]]
|volume=34
|issue=2–3
|pages=266&ndash;292
|doi=10.1016/0022-0000(87)90027-4
|doi-access=free
}}

{{DEFAULTSORT:Horn clause}}
[[Category:Logic in computer science]]
[[Category:Normal forms (logic)]]
{{Normal forms in logic}}