On solving Boolean combinations of UTVPI constraints.
From MaRDI portal
Recommendations
- Incremental satisfiability and implication for UTVPI constraints
- Frontiers of Combining Systems
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- On integer closure in a system of unit two variable per inequality constraints
Cited in
(16)- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Feasibility checking in Horn constraint systems through a reduction based approach
- A combinatorial algorithm for Horn programs
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- General lower bounds and improved algorithms for infinite-domain CSPs
- A Graphical Theorem of the Alternative for UTVPI Constraints
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Incremental satisfiability and implication for UTVPI constraints
- Approximating infeasible 2VPI-systems
- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
- Frontiers of Combining Systems
- Theory and Applications of Satisfiability Testing
- Algorithms and complexity of difference logic
- Optimal length resolution refutations of difference constraint systems
This page was built for publication: On solving Boolean combinations of UTVPI constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309034)
