Corpus ID: 17360197

A Verified Decision Procedure for Pseudo-Boolean Formulas

@inproceedings{Philipp2016AVD,
  title={A Verified Decision Procedure for Pseudo-Boolean Formulas},
  author={T. Philipp and Anna Tigunova},
  booktitle={PlanSIG},
  year={2016}
}
  • T. Philipp, Anna Tigunova
  • Published in PlanSIG 2016
  • Computer Science
  • Pseudo-Boolean formulas consist of constraints of the form ∑i=1 wi · xi k, where xi are propositional literals, wi ∈ Z, k ∈ Z, and arise in planning, scheduling and optimization problems. We describe an efficient and easily verifiable decision procedure for pseudo-Boolean formulas, that is based on encoding PB formulas into the propositional satisfiability problem with the cutting-edge sequential weighted counter encoding. State-of-the-art SAT solvers that emit unsatisfiability proofs are used… CONTINUE READING
    1 Citations
    Towards a Semantics of Unsatisfiability Proofs with Inprocessing
    • 10
    • PDF

    References

    SHOWING 1-10 OF 36 REFERENCES
    A Compact Encoding of Pseudo-Boolean Constraints into SAT
    • 22
    • PDF
    Translating Pseudo-Boolean Constraints into SAT
    • 604
    • Highly Influential
    • PDF
    Inprocessing Rules
    • 166
    • Highly Influential
    • PDF
    Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
    • C. Sinz
    • Mathematics, Computer Science
    • CP
    • 2005
    • 387
    • PDF
    Probing-based preprocessing techniques for propositional satisfiability
    • I. Lynce, Joao Marques-Silva
    • Computer Science
    • Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence
    • 2003
    • 65
    • PDF
    New Encodings of Pseudo-Boolean Constraints into CNF
    • 97
    • PDF
    Blocked Clause Elimination
    • 123
    • PDF
    Symbolic model checking using SAT procedures instead of BDDs
    • 354
    • PDF