Fast and Flexible Difference Constraint Propagation for DPLL(T)
From MaRDI portal
Recommendations
Cited in
(26)- Stable models and difference logic
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Empirical analysis of algorithms for the shortest negative cost cycle problem
- Randomized algorithms for finding the shortest negative cost cycle in networks
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Analyzing unit read-once refutations in difference constraint systems
- A logic-based Benders decomposition for microscopic railway timetable planning
- Solving strong controllability of temporal problems with uncertainty using SMT
- Feasibility checking in Horn constraint systems through a reduction based approach
- SAT modulo graphs: acyclicity
- Learning general constraints in CSP
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Satisfiability modulo theories
- Model Checking Real-Time Systems
- Clingo goes linear constraints over reals and integers
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Interpolant Generation for UTVPI
- A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
- Efficient Interpolant Generation in Satisfiability Modulo Theories
- Theory and Applications of Models of Computation
- Set covering heuristics in a benders decomposition for railway timetabling
- Unit read-once refutations for systems of difference constraints
- Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes
- Decomposition strategies and multi-shot ASP solving for job-shop scheduling
- How to build your own ASP-based system?!
This page was built for publication: Fast and Flexible Difference Constraint Propagation for DPLL(T)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756581)