Pages that link to "Item:Q5310643"
From MaRDI portal
The following pages link to Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (Q5310643):
Displaying 11 items.
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers (Q453505) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773) (← links)
- Bounding quantification in parametric expansions of Presburger arithmetic (Q1661676) (← links)
- Cutting to the chase. (Q2351157) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- An Analysis of Slow Convergence in Interval Propagation (Q3523087) (← links)
- (Q4503970) (← links)
- Interpolant Generation for UTVPI (Q5191101) (← links)