A Propositional CONEstrip Algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Processing and Management of Uncertainty in Knowledge-Based Systems - 15th International Conference, IPMU 2014, Proceedings
PublisherSpringer
Pages466-475
Number of pages10
EditionPART 3
ISBN (Print)9783319088518
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event15th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, IPMU 2014 - Montpellier, France
Duration: 15 Jul 201419 Jul 2014

Publication series

NameCommunications in Computer and Information Science
NumberPART 3
Volume444 CCIS
ISSN (Print)1865-0929

Conference

Conference15th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, IPMU 2014
CountryFrance
CityMontpellier
Period15/07/1419/07/14

Keywords

  • Coherence
  • Consistency
  • Inference
  • Linear programming
  • Natural extension
  • PSAT
  • Row generation
  • SAT
  • Satisfiability
  • Sets of desirable gambles
  • WPMaxSAT

Fingerprint Dive into the research topics of 'A Propositional CONEstrip Algorithm'. Together they form a unique fingerprint.

Cite this