SMCHR: Satisfiability modulo constraint handling rules

DOI10.1017/S1471068412000208zbMath1260.68059arXiv1210.5307OpenAlexW2138259059MaRDI QIDQ4911137

Gregory J. Duck

Publication date: 13 March 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.5307

zbMATH Keywords

satisfiability modulo theorieslazy clause generationCHR

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Shape Neutral Analysis of Graph-based Data-structures

Uses Software

• SMCHR

Cites Work

• Propagation via lazy clause generation
• SWI-Prolog
• As time goes by: Constraint Handling Rules
• Solving SAT and SAT Modulo Theories
• Adaptive CHR Meets CHR ∨
• Parma—bridging the performance gap between imperative and logic programming

This page was built for publication: SMCHR: Satisfiability modulo constraint handling rules