Concurrent Goal-Based Execution of Constraint Handling Rules
Edmund S. L. Lam, Martin Sulzmann
TL;DR
This paper presents a concurrent execution scheme for Constraint Handling Rules (CHR) that guarantees correctness and reproducibility based on a goal-based semantics, paving the way for efficient parallel implementations.
Contribution
It introduces a systematic concurrent execution model for CHR grounded in a goal-based semantics, with formal guarantees of correctness and reproducibility.
Findings
Establishes strong correspondence between concurrent and abstract CHR semantics.
Provides theoretical foundation for efficient parallel CHR execution.
Guarantees reproducibility of answers in concurrent and sequential semantics.
Abstract
(To appear in Theory and Practice of Logic Programming (TPLP)) We introduce a systematic, concurrent execution scheme for Constraint Handling Rules (CHR) based on a previously proposed sequential goal-based CHR semantics. We establish strong correspondence results to the abstract CHR semantics, thus guaranteeing that any answer in the concurrent, goal-based CHR semantics is reproducible in the abstract CHR semantics. Our work provides the foundation to obtain efficient, parallel CHR execution schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Constraint Satisfaction and Optimization · Semantic Web and Ontologies