In logic programming a definite clause behaves as a goal-reduction procedure. For example, the Horn clause written above behaves as the procedure:
ɪ n WORD_BOUNDARY l ɑ d̠ʒ ɪ k WORD_BOUNDARY p ɹ oʊ ɡ ɹ æ m ɪ ŋ WORD_BOUNDARY ʌ WORD_BOUNDARY d ɛ f ɪ n ə t WORD_BOUNDARY k l ɔ z WORD_BOUNDARY b ɪ h eɪ v z WORD_BOUNDARY æ z WORD_BOUNDARY ʌ WORD_BOUNDARY ɡ oʊ l ɹ ɪ d ʌ k ʃ ə n WORD_BOUNDARY p ɹ ə s iː d̠ʒ ə ɹ WORD_BOUNDARY f ɔ ɹ WORD_BOUNDARY ɛ ɡ z æ m p ə l WORD_BOUNDARY ð ə WORD_BOUNDARY h ɔ ɹ n WORD_BOUNDARY k l ɔ z WORD_BOUNDARY ɹ ɪ t ə n WORD_BOUNDARY ə b ʌ v WORD_BOUNDARY b ɪ h eɪ v z WORD_BOUNDARY æ z WORD_BOUNDARY ð ə WORD_BOUNDARY p ɹ ə s iː d̠ʒ ə ɹ WORD_BOUNDARY