Horn clauses play a basic role in constructive logic and computational logic. They are important in automated theorem proving by first-order resolution, because the resolvent of two Horn clauses is itself a Horn clause, and the resolvent of a goal clause and a definite clause is a goal clause. These properties of Horn clauses can lead to greater efficiencies in proving a theorem (represented as the negation of a goal clause).
h ɔ ɹ n WORD_BOUNDARY k l ɔ z ɪ z WORD_BOUNDARY p l eɪ WORD_BOUNDARY ʌ WORD_BOUNDARY b eɪ s ɪ k WORD_BOUNDARY ɹ oʊ l WORD_BOUNDARY ɪ n WORD_BOUNDARY k ə n s t ɹ ʌ k t ɪ v WORD_BOUNDARY l ɑ d̠ʒ ɪ k WORD_BOUNDARY æ n d WORD_BOUNDARY k ɑ m p j uː t eɪ ʃ ə n ə l WORD_BOUNDARY l ɑ d̠ʒ ɪ k WORD_BOUNDARY ð eɪ WORD_BOUNDARY ɑ ɹ WORD_BOUNDARY ɪ m p ɔ ɹ t ə n t WORD_BOUNDARY ɪ n WORD_BOUNDARY ɔ t ə m eɪ t ɪ d WORD_BOUNDARY θ iə ɹ ə m WORD_BOUNDARY p ɹ uː v ɪ ŋ WORD_BOUNDARY b aɪ WORD_BOUNDARY f ɜː s t ɔ ɹ d ə ɹ WORD_BOUNDARY ɹ ɛ z ə l uː ʃ ə n WORD_BOUNDARY b ɪ k ʌ z WORD_BOUNDARY ð ə WORD_BOUNDARY ɹ ɪ z ɑ l v ə n t WORD_BOUNDARY ʌ v WORD_BOUNDARY t uː WORD_BOUNDARY h ɔ ɹ n WORD_BOUNDARY k l ɔ z ɪ z WORD_BOUNDARY ɪ z WORD_BOUNDARY ɪ t s ɛ l f WORD_BOUNDARY ʌ WORD_BOUNDARY h ɔ ɹ n WORD_BOUNDARY k l ɔ z WORD_BOUNDARY æ n d WORD_BOUNDARY ð ə WORD_BOUNDARY ɹ ɪ z ɑ l v ə n t WORD_BOUNDARY ə v ə WORD_BOUNDARY ɡ oʊ l WORD_BOUNDARY k l ɔ z WORD_BOUNDARY æ n d WORD_BOUNDARY ʌ WORD_BOUNDARY d ɛ f ɪ n ə t WORD_BOUNDARY k l ɔ z WORD_BOUNDARY ɪ z WORD_BOUNDARY ʌ WORD_BOUNDARY ɡ oʊ l WORD_BOUNDARY k l ɔ z WORD_BOUNDARY ð iː z WORD_BOUNDARY p ɹ ɑ p ə ɹ t i z WORD_BOUNDARY ʌ v WORD_BOUNDARY h ɔ ɹ n WORD_BOUNDARY k l ɔ z ɪ z WORD_BOUNDARY k æ n WORD_BOUNDARY l iː d WORD_BOUNDARY t ə WORD_BOUNDARY ɡ ɹ eɪ t ə ɹ ɹ WORD_BOUNDARY ɪ f ɪ ʃ ə n s i z WORD_BOUNDARY ɪ n WORD_BOUNDARY p ɹ uː v ɪ ŋ WORD_BOUNDARY ʌ WORD_BOUNDARY θ iə ɹ ə m WORD_BOUNDARY ɹ ɛ p ɹ ɪ z ɛ n t ɪ d WORD_BOUNDARY æ z WORD_BOUNDARY ð ə WORD_BOUNDARY n ɪ ɡ eɪ ʃ ə n WORD_BOUNDARY ə v ə WORD_BOUNDARY ɡ oʊ l WORD_BOUNDARY k l ɔ z WORD_BOUNDARY