{"type":"ScholarlyArticle","title":"Satisfiability Modulo Constraint Handling Rules (Extended Abstract)","authors":[{"name":"Gregory James Duck","slug":"gregory-james-duck","given":"Gregory James","family":"Duck","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/444","pdf":"https://ijcai.org/proceedings/2013/0444.pdf","markdown":"https://ijcai.org/proceedings/2013/444.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/444","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":444,"pages":{"first":2997,"last":3000},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}