Satisfiability modulo constraint handling rules (extended abstract)

Authors:
Gregory J. Duck
Affiliations:
School of Computing, National University of Singapore
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 7
Cited 0

A machine program for theorem-proving

Communications of the ACM
Propagation via lazy clause generation

Constraints
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Satisfiability modulo theories: introduction and applications

Communications of the ACM
Swi-prolog

Theory and Practice of Logic Programming - Prolog Systems
Engineering theories with z3

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Smchr: Satisfiability modulo constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.