A propositional CONEstrip algorithm

DOI10.1007/978-3-319-08852-5_48MaRDI QIDQ5227400zbMATH OpenOpenAlexFDO

Authors 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

coherenceconsistencylinear programminginferenceSATsatisfiabilityrow generationsets of desirable gamblesnatural extensionPSATWPMaxSAT

Mathematics Subject Classification ID

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

Recommendations

• The CONEstrip algorithm
• A primal conical linear programming algorithm
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Algorithms for imprecise probabilities

Cites work

• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 1522934 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Accept \& reject statement-based uncertainty models
• Algorithms for Weighted Boolean Optimization
• Desirability
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Handbook of knowledge representation.
• Probabilistic logic under coherence: complexity and algorithms
• Probabilistic satisfiability
• Probabilistic satisfiability and coherence checking through integer programming
• Probabilistic satisfiability with imprecise probabilities
• Probability logic and optimization SAT: The PSAT and CPA models
• Simplification rules for the coherent probability assessment problem
• The CONEstrip algorithm
• Towards a unified theory of imprecise probability

Cited in

(5)

• Playing with sets of lexicographic probabilities and sets of desirable gambles
• Evenly convex credal sets
• Improved linear programming methods for checking avoiding sure loss
• Probabilistic satisfiability and coherence checking through integer programming
• The CONEstrip algorithm

This page was built for publication: A propositional CONEstrip algorithm

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