✦ LIBER ✦

Horn clause computability

✍ Scribed by Sten-Åke Tärnlund

Publisher: Springer Netherlands
Year: 1977
Tongue: English
Weight: 746 KB
Volume: 17
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932293

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to compute maximal contract

An algorithm to compute maximal contractions for Horn clauses

✍ Jie Luo; Wei Li 📂 Article 📅 2011 🏛 Science in China Press (SCP) 🌐 English ⚖ 261 KB

Non-Horn clause logic programming

✍ Xumin Nie 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

There has been active work to extend the Prolog style Horn clause logic programming to non-Horn clauses. In this paper, we analyze and compare several such extensions using an analytical approach. All the extensions discussed behave exactly like Prolog when only Horn clauses are involved. The purpos

Multi-engine Horn Clause Prolog

✍ Paul Tarau 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 31 KB

Question-asking strategies for Horn clau

Question-asking strategies for Horn clause systems

✍ Jinchang Wang; John Vande Vate 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 706 KB

Renaming a set of non-Horn clauses

✍ Xumin Nie; Qing Guo 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 492 KB

The horn basis of a set of clauses

✍ Jean-Jacques Hébrard; Philippe Luquet 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 425 KB

We formalize the idea that a set of propositional clauses that is not Horn-renamable can still be partially so. We show that for any finite set of clauses S defined on a set of variables V, there exists a largest subset U of V, with regard to inclusion, such that S is Horn-renamable with respect to