✦ LIBER ✦

Renaming a set of non-Horn clauses

✍ Scribed by Xumin Nie; Qing Guo

Publisher: Springer
Year: 2000
Tongue: English
Weight: 492 KB
Volume: 15
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02950403

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Characterizing consistency in probabilis

Characterizing consistency in probabilistic logic for a class of Horn clauses

✍ K. A. Andersen 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 848 KB

Disjoint essential sets of implicates of

Disjoint essential sets of implicates of a CQ Horn function

✍ Ondřej Čepek; Petr Kučera 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 365 KB

A set of stationary non-Maxwellian distr

A set of stationary non-Maxwellian distributions

✍ G. Kaniadakis; P. Quarati 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 625 KB

A non-cooperative interpretation of barg

A non-cooperative interpretation of bargaining sets

✍ Ezra Einy; David Wettstein 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 66 KB