Optimization and probabilistic satisfiability on nested and co-nested formulas

DOI10.1007/s10479-008-0502-3zbMath1225.90149OpenAlexW2020252026MaRDI QIDQ646722

Daniele Pretolani

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0502-3

zbMATH Keywords

algorithmsouterplanar graphsmaximum satisfiabilitynested and co-nested formulaspolynomially solvable classesprobabilistic satisfiability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Nested satisfiability
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Probabilistic satisfiability
• Satisfiability of co-nested formulas
• Simplification rules for the coherent probability assessment problem
• Probability logic and optimization SAT: The PSAT and CPA models
• The basic algorithm for pseudo-Boolean programming revisited
• Easy cases of probabilistic satisfiability
• A class of logic problems solvable by linear programming
• Theory and Applications of Satisfiability Testing
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Optimization and probabilistic satisfiability on nested and co-nested formulas