Satisfiability Modulo Constraint Handling Rules (Extended Abstract)
نویسنده
چکیده
Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm manipulates a global store representing a flat conjunction of constraints. This paper introduces SMCHR: a tight integration of CHR with a modern Boolean Satisfiability (SAT) solver. Unlike CHR, SMCHR can handle (quantifier-free) formulae with an arbitrary propositional structure. SMCHR is essentially a Satisfiability Modulo Theories (SMT) solver where the theory T is implemented in CHR.
منابع مشابه
SMCHR: Satisfiability modulo constraint handling rules
Constraint Handling Rules (CHRs) are a high-level rule-based programming language for specification and implementation of constraint solvers. CHR manipulates a global store representing a flat conjunction of constraints. By default, CHR does not support goals with a more complex propositional structure including disjunction, negation, etc., or CHR relies on the host system to provide such featu...
متن کاملArgument-based Constraint Logic-Programming in Satisfiability Modulo CHR
We revise classical results in Argumentation-based Logic Programming, e.g., Defeasible Logic Programming (DeLP), under the umbrella of Satisfiability Modulo CHR. Through this language it is possible to reason on arguments and have an underlying theory solver to implement resolution of conflicts. Strict and defeasible rules, as well as certainty scores associated with such rules (e.g., Possibili...
متن کاملCombining parallel techniques for Cloud-Based SMT Solving
Satisfiability Modulo Theories (SMT) is a highly expressive language that combines propositional satisfiability with first-order logics allowing the modelling of constraint problems arising from practical domains in a natural way. The increasing popularity of SMT requires SMT solvers to be capable of handling increasingly complex constraint problems. This paper shows how cloud computing could s...
متن کاملConfluence Modulo Equivalence in Constraint Handling Rules
Previous results on confluence for Constraint Handling Rules, CHR, are generalized to take into account user-defined state equivalence relations. This allows a much larger class of programs to enjoy the advantages of confluence, which include various optimization techniques and simplified correctness proofs. A new operational semantics for CHR is introduced that reduces notational overhead sign...
متن کامل