✦ LIBER ✦

On renaming a set of clauses as a Horn set

✍ Scribed by Greg Lindhorst; Farhad Shahrokhi

Book ID: 113163468
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 566 KB
Volume: 30
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90229-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Renaming a set of non-Horn clauses

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

A fast algorithm for renaming a set of c

A fast algorithm for renaming a set of clauses as a horn set

✍ Heikki Mannila; Kurt Mehlhorn 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 282 KB

A linear algorithm for renaming a set of

A linear algorithm for renaming a set of clauses as a Horn set

✍ Jean-Jacques Hébrard 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 357 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

A reducing method for set of clauses usi

A reducing method for set of clauses using matrices

✍ Hiroaki Nishioka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 554 KB

A reducing method for a set of clauses u

A reducing method for a set of clauses using prepositional formulas

✍ Hiroaki Nishioka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 613 KB