A propositional CONEstrip algorithm

DOI10.1007/978-3-319-08852-5_48zbMATH Open1456.68182OpenAlexW2121621366MaRDI QIDQ5227400FDOQ5227400

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

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

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)

Cites Work

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

Cited In (5)

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

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)