@inproceedings{1cd3e0d227b54a51987967a35551bf75,
title = "A Propositional CONEstrip Algorithm",
abstract = "We present a variant of the CONEstrip algorithm for checking whether the origin lies in a finitely generated convex cone that can be open, closed, or neither. This variant is designed to deal efficiently with problems where the rays defining the cone are specified as linear combinations of propositional sentences. The variant differs from the original algorithm in that we apply row generation techniques. The generator problem is WPMaxSAT, an optimization variant of SAT; both can be solved with specialized solvers or integer linear programming techniques. We additionally show how optimization problems over the cone can be solved by using our propositional CONEstrip algorithm as a preprocessor. The algorithm is designed to support consistency and inference computations within the theory of sets of desirable gambles. We also make a link to similar computations in probabilistic logic, conditional probability assessments, and imprecise probability theory.",
keywords = "Coherence, Consistency, Inference, Linear programming, Natural extension, PSAT, Row generation, SAT, Satisfiability, Sets of desirable gambles, WPMaxSAT",
author = "Erik Quaeghebeur",
year = "2014",
doi = "10.1007/978-3-319-08852-5_48",
language = "English",
isbn = "9783319088518",
series = "Communications in Computer and Information Science",
publisher = "Springer",
number = "PART 3",
pages = "466--475",
booktitle = "Information Processing and Management of Uncertainty in Knowledge-Based Systems - 15th International Conference, IPMU 2014, Proceedings",
address = "Germany",
edition = "PART 3",
note = "15th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, IPMU 2014 ; Conference date: 15-07-2014 Through 19-07-2014",
}