Integer feasibility and refutations in UTVPI constraints using bit-scaling
From MaRDI portal
Publication:2684489
Recommendations
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Incremental satisfiability and implication for UTVPI constraints
- On solving Boolean combinations of UTVPI constraints.
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
Cites work
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A Machine-Oriented Logic Based on the Resolution Principle
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Analyzing read-once cutting plane proofs in Horn systems
- Feasibility checking in Horn constraint systems through a reduction based approach
- Finding read-once resolution refutations in systems of 2CNF clauses
- Fourier-Motzkin elimination and its dual
- Frontiers of Combining Systems
- scientific article; zbMATH DE number 1256654 (Why is no real title available?)
- Incremental satisfiability and implication for UTVPI constraints
- Introduction to algorithms
- Logic for Programming, Artificial Intelligence, and Reasoning
- Lower bounds for cutting planes proofs with small coefficients
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Minimum 2CNF Resolution Refutations in Polynomial Time
- Network flows. Theory, algorithms, and applications.
- On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
- On integer closure in a system of unit two variable per inequality constraints
- On solving Boolean combinations of UTVPI constraints.
- On the complexity of cutting-plane proofs
- Optimal length resolution refutations of difference constraint systems
- Optimal length tree-like resolution refutations for 2SAT formulas
- Outline of an algorithm for integer solutions to linear programs
- Scaling Algorithms for the Shortest Paths Problem
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- The intractability of resolution
- The octagon abstract domain
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
Cited in
(15)- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- On integer closure in a system of unit two variable per inequality constraints
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Read-once certification of linear infeasibility in UTVPI constraints
- A polynomial time algorithm for read-once certification of linear infeasibility in 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
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- On solving Boolean combinations of UTVPI constraints.
- Frontiers of Combining Systems
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints
This page was built for publication: Integer feasibility and refutations in UTVPI constraints using bit-scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2684489)
