A Propositional CONEstrip Algorithm

DOI10.1007/978-3-319-08852-5_48zbMath1456.68182OpenAlexW2121621366MaRDI QIDQ5227400

Erik Quaeghebeur

Publication date: 26 July 2019

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1854/LU-5814652

zbMATH Keywords

linear programmingconsistencycoherencesatisfiabilitynatural extensioninferenceSATsets of desirable gamblesrow generationPSATWPMaxSAT

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Improved linear programming methods for checking avoiding sure loss ⋮ Evenly convex credal sets ⋮ Probabilistic satisfiability and coherence checking through integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logic under coherence: complexity and algorithms
• Probabilistic satisfiability
• Simplification rules for the coherent probability assessment problem
• Towards a unified theory of imprecise probability
• Probabilistic satisfiability with imprecise probabilities
• Probability logic and optimization SAT: The PSAT and CPA models
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Accept \& reject statement-based uncertainty models
• The CONEstrip Algorithm
• Desirability
• Algorithms for Weighted Boolean Optimization
• Probabilistic Satisfiability and Coherence Checking through Integer Programming

This page was built for publication: A Propositional CONEstrip Algorithm