✦ LIBER ✦

Number of models and satisfiability of sets of clauses

✍ Scribed by Wenhui Zhang

Book ID: 107948861
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 544 KB
Volume: 155
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00144-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sets of Prime Numbers Satisfying a Divis

Sets of Prime Numbers Satisfying a Divisibility Condition

✍ Paul Erdo&#x030B;s; Anthony B. Evans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We study sets P of k primes that satisfy the condition gcd(> A&> B, > P)=1 whenever A and B are disjoint non-empty subsets of P. It is known that such sets of primes exist for all positive integers k. It is of interest to know the asymptotic behavior of n k , the smallest natural number that is the

On the occurrence of null clauses in ran

On the occurrence of null clauses in random instances of satisfiability

✍ John Franco 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 426 KB

A note on the complexity of the satisfia

A note on the complexity of the satisfiability of modal Horn clauses

✍ Luis Fariñas Del Cerro; Martti Penttonen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Real Number Models under Various Sets of

Real Number Models under Various Sets of Operations

✍ K. Meer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Satisfiability of Dataflow Models of Dis

Satisfiability of Dataflow Models of Distributed Programs

✍ V. V. Toporkov 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 67 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