✦ LIBER ✦

Algorithms for testing the satisfiability of propositional formulae

✍ Scribed by Giorgio Gallo; Giampaolo Urbani

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 590 KB
Volume: 7
Category: Article
ISSN: 0743-1066
DOI: 10.1016/0743-1066(89)90009-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some bandwidth restricted versions of

On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

✍ V. Arvind; S. Biswas 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 797 KB

The computational complexity of satisfia

The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic

✍ Cheng-Chia Chen; I-Peng Lin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 627 KB

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

A note on Dowling and Gallier's top-down

A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability

✍ Maria Grazia Scutellà 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 520 KB

A General Upper Bound for the Satisfiabi

A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae

✍ O Dubois; Y Boufkhad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Experiments on solving r-SAT random formulae have provided evidence of a satisfiability threshold phenomenon with respect to the ratio of the number of clauses to the number of variables of formulae. Presently, only the threshold of 2-SAT formulae has been proved to exist and has been computed to be

Optimization and Physics: On the Satisfi

Optimization and Physics: On the Satisfiability of Random Boolean Formulae

✍ Marc Mézard 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 264 KB