Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Fast and Flexible Difference Constraint Propagation for DPLL(T) - MaRDI portal

Fast and Flexible Difference Constraint Propagation for DPLL(T)

From MaRDI portal
Publication:5756581

DOI10.1007/11814948_19zbMath1187.68537OpenAlexW1488662850MaRDI QIDQ5756581

Oded Maler, Scott Cotton

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_19



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (22)

Problem Decomposition and Multi-shot ASP Solving for Job-shop SchedulingStochastic Local Search for SMT: Combining Theory Solvers with WalkSATEmpirical analysis of algorithms for the shortest negative cost cycle problemSatisfiability Modulo TheoriesModel Checking Real-Time SystemsLearning general constraints in CSPA logic-based Benders decomposition for microscopic railway timetable planningSAT Modulo Graphs: AcyclicitySet covering heuristics in a benders decomposition for railway timetablingClingo goes linear constraints over reals and integersRandomized algorithms for finding the shortest negative cost cycle in networksUnit read-once refutations for systems of difference constraintsA mechanical verification of the stressing algorithm for negative cost cycle detection in networksInterpolant Generation for UTVPIDecidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicatesEfficient Interpolant Generation in Satisfiability Modulo TheoriesOn the parametrized complexity of Read-once refutations in UTVPI+ constraint systemsAnalyzing unit read-once refutations in difference constraint systemsStable models and difference logicDelayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysisSolving strong controllability of temporal problems with uncertainty using SMTFeasibility checking in Horn constraint systems through a reduction based approach


Uses Software



This page was built for publication: Fast and Flexible Difference Constraint Propagation for DPLL(T)