✦ LIBER ✦

On the complexity of the maximum satisfiability problem for horn formulas

✍ Scribed by Brigitte Jaumard; Bruno Simeone

Book ID: 113162983
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 498 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90028-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the Query Complexity of Clique Size a

On the Query Complexity of Clique Size and Maximum Satisfiability

✍ Richard Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 682 KB

This paper explores the bounded query complexity of approximating the size of the maximum clique in a graph (Clique Size) and the number of simultaneously satisfiable clauses in a 3CNF formula (MaxSat). The results in the paper show that for certain approximation factors, approximating Clique Size a

Probabilistic bounds and algorithms for

Probabilistic bounds and algorithms for the maximum satisfiability problem

✍ Endre Boros; András Prékopa 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 879 KB

Modified extremal optimization for the h

Modified extremal optimization for the hard maximum satisfiability problem

✍ Guo-qiang Zeng; Yong-zai Lu; Wei-Jie Mao 📂 Article 📅 2011 🏛 SP Zhejiang University Press 🌐 English ⚖ 568 KB

An effective heuristic algorithm for the

An effective heuristic algorithm for the maximum satisfiability problem

✍ Mohamed El Bachir Menaï; Mohamed Batouche 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 614 KB