Extending Constraint-Only Representation of Polyhedra with Boolean Constraints
Abstract elided by the publisher.
Related papers
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints TACAS 2009
- Symbolic Boolean derivatives for efficiently solving extended regular expression constraints PLDI 2021
- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra SAS 2013
- Extended lattice-based memory allocation CC 2016
- Clausal Proofs for Pseudo-Boolean Reasoning TACAS 2022
- Scanning Polyhedra with DO Loops PPoPP 1991
- Boolean Satisfiability with Transitivity Constraints CAV 2000
- A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints CAV 2009