Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
Sat4j is a mature, open source library of SAT-based solvers in Java. It provides a modular SAT solver architecture designed to work with generic constraints. Such architecture is ...