Optimization and probabilistic satisfiability on nested and co-nested formulas

Daniele Pretolani ()

Annals of Operations Research, 2011, vol. 188, issue 1, 387 pages

Abstract: Nested and co-nested formulas are two classes of CNF instances that can be characterized in terms of outerplanar graphs. For these classes, linear time algorithms are known for SAT and (unweighted) Max-SAT. In this paper we devise linear time algorithms for a general optimization version of SAT. Moreover, we show that a general probabilistic version of SAT reduces to solving a system of linear inequalities where the number of variables and constraints is linear in the size of the formula. Copyright Springer Science+Business Media, LLC 2011

Keywords: Maximum satisfiability; Probabilistic satisfiability; Nested and co-nested formulas; Outerplanar graphs; Algorithms; Polynomially solvable classes (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0502-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:188:y:2011:i:1:p:371-387:10.1007/s10479-008-0502-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-008-0502-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().