The following pages link to Frontiers of Combining Systems (Q5491898):
Displaying 26 items.
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- Colors Make Theories Hard (Q2817916) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- Combining Decision Procedures by (Model-)Equality Propagation (Q5179357) (← links)
- Reachability in choice networks (Q6108917) (← links)
