Optimization and probabilistic satisfiability on nested and co-nested formulas

DOI10.1007/S10479-008-0502-3MaRDI QIDQ646722zbMATH OpenOpenAlexFDO

Authors D. 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

algorithmsmaximum satisfiabilitynested and co-nested formulasouterplanar graphspolynomially solvable classesprobabilistic satisfiability

Mathematics Subject Classification ID

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

Recommendations

• Satisfiability of co-nested formulas
• Generalized probabilistic satisfiability
• Probability logic and optimization SAT: The PSAT and CPA models
• Strong backdoors to nested satisfiability
• Easy cases of probabilistic satisfiability

Cites work

• A class of logic problems solvable by linear programming
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Easy cases of probabilistic satisfiability
• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 5838699 (Why is no real title available?)
• Nested satisfiability
• Network flows. Theory, algorithms, and applications.
• Probabilistic logic
• Probabilistic satisfiability
• Probability logic and optimization SAT: The PSAT and CPA models
• Satisfiability of co-nested formulas
• Simplification rules for the coherent probability assessment problem
• The basic algorithm for pseudo-Boolean programming revisited
• Theory and Applications of Satisfiability Testing

Cited in

(1)

• Satisfiability of co-nested formulas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646722)