research-article

A compositional semantics for CHR

Authors:

Maurizio Gabbrielli,

Maria Chiara MeoAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 10, Issue 2

Article No.: 11, Pages 1 - 36

https://doi.org/10.1145/1462179.1462183

Published: 02 March 2009 Publication History

Abstract

Constraint Handling Rules (CHR) is a committed-choice declarative language which has been designed for writing constraint solvers. A CHR program consists of multiheaded guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached.

CHR has received considerable attention, both from the practical and from the theoretical side. Nevertheless, due the use of multiheaded clauses, there are several aspects of the CHR semantics which have not been clarified yet. In particular, no compositional semantics for CHR has been defined so far.

In this article we introduce a fix-point semantics which characterizes the input/output behavior of a CHR program and which is and-compositional, that is, which allows to retrieve the semantics of a conjunctive query from the semantics of its components. Such a semantics can be used as a basis to define incremental and modular analysis and verification tools.

References

[1]

Abdennadher, S. 1997. Operational semantics and confluence of constraint propagation rules. In Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP'97), G. Smolka, Ed. Lecture Notes in Computer Science, vol. 1330. Springer.

Digital Library

[2]

Abdennadher, S. and Frühwirth, T. 2003. Essentials of Constraint Programming. Springer.

Digital Library

[3]

Betz, H. and Frühwirth, T. 2005. A linear-logic semantics for constraint handling rules. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP '05). Lecture Notes in Computer Science, vol. 3709. Springer.

[4]

de Boer, F. S., Gabbrielli, M., Marchiori, E., and Palamidessi, C. 1997. Proving concurrent constraint programs correct. ACM Trans. Program. Lang. Syst. 19, 5, 685--725.

Digital Library

[5]

de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2000. A timed concurrent constraint language. Inf. Comput. 161, 1, 45--83.

Digital Library

[6]

de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2004. Proving correctness of timed concurrent constraint programs. ACM Trans. Comput. Logic 5, 4, 706--731.

Digital Library

[7]

de Boer, F. S., Gabbrielli, M., and Meo, M. C. 2004. A timed Iinda language and its denotational semantics. Fundam. Inf. 63, 4, 309--330.

Digital Library

[8]

de Boer, F. S., Kok, J. N., Palamidessi, C., and Rutten, J. J. M. M. 1991. The failure of failures in a paradigm for asynchronous communication. In J. C. M. Baeten and J. F. Groote, editors, Proceedings of the International Conference on Concurrency Theory (CONCUR'91). Lecture Notes in Computer Science, vol. 527, Springer, 111--126.

Digital Library

[9]

de Boer, F. S. and Palamidessi, C. 1991. A fully abstract model for concurrent constraint programming. In S. Abramsky and T. S. E. Maibaum, Eds. Proceedings of the International Joint Conference on Theory and Practice of Software Development/Colloquium on Trees in Algebra and Programming (TAPSOFT/CAAP). Lecture Notes in Computer Science, vol. 493, Springer, 296--319.

Digital Library

[10]

Bossi, A., Gabbrielli, M., Levi, G., and Meo, M. C. 1992. A compositional semantics for logic programs. Theor. Comput. Sci. 122, 1-2, 3--47.

Digital Library

[11]

Brookes, S. 1993. A fully abstract semantics of a shared variable parallel language. In Proceedings of the 8th IEEE Symposium on Logic In Computer Science. IEEE Computer Society Press.

[12]

Codish, M., Debray, S., and Giacobazzi, R. 1993. Compositional analysis of modular logic programs. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM Press, 451--464.

Digital Library

[13]

Davey, B. A. and Priestley, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press.

[14]

Delzanno, G., Gabbrielli, M., and Meo, M. C. 2005. A compositional semantics for CHR. In Proceedings of the ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'05). ACM Press.

Digital Library

[15]

Duck, G. J., de la Banda, M. G., and Stuckey, P. J. 2004. The refined operational semantics of constraint handling rules. In Proceedings of the 20th International Conference on Logic Programming, (ICLP'04).

[16]

Falaschi, M., Gabbrielli, M., Marriott, K., and Palamidessi, C. 1993. Compositional analysis of concurrent constraint languages. In Proceedings of the 8th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press.

[17]

Frühwirth, T. 1991. Introducing simplification rules. Tech. rep. TR ECRC-LP-63, ECRC Munich. October.

[18]

Frühwirth, T. 1998. Theory and practice of constraint handling rules. J. Logic Program. 37, 1-3, 95--138.

[19]

Gabbrielli, M., Meo, M. C., and Tacchella, P. 2006. A compositional semantics for CHR with propagation rules. In Proceedings of the 3rd Workshop on Constraint Handling Rules. Tech. rep. CW 425, Katholieke Universiteit Leuven. June.

[20]

Henzinger, T. A., Qadeer, S., and Rajamani, S. K. 1998. You assume we guarantee: Methodology and case studies. In Proceedings of the International Conference on Computer-Aided Verification (CAV'98). Lecture Notes in Computer Science, pp. 440--451. Springer-Verlag.

Digital Library

[21]

Jonsson, B. 1985. A model and a proof system for asynchronous processes. In Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, 49--58.

Digital Library

[22]

Maher, M. 2002. Propagation completeness of reactive constraints. In Proceedings of the International Conference on Logic Programming (ICLP), 148--162.

Digital Library

[23]

Meister, M., Djelloul, K., and Robin, J. 2007. A unified semantics for CHR in transaction logic. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07). Lecture Notes in Artificial Intelligence, vol. 4483, Springer, 201--213.

Digital Library

Cited By

Frühwirth T(2015)Constraint Handling Rules - What Else?Rule Technologies: Foundations, Tools, and Applications10.1007/978-3-319-21542-6_2(13-34)Online publication date: 12-Jul-2015
https://doi.org/10.1007/978-3-319-21542-6_2
HAEMMERLÉ R(2011)(Co-)Inductive semantics for Constraint Handling RulesTheory and Practice of Logic Programming10.1017/S147106841100019611:4-5(593-609)Online publication date: 6-Jul-2011
https://doi.org/10.1017/S1471068411000196
SNEYERS JVAN WEERT PSCHRIJVERS TDE KONINCK L(2009)As time goes by: Constraint Handling RulesTheory and Practice of Logic Programming10.1017/S147106840999012310:01(1-47)Online publication date: 22-Dec-2009
https://doi.org/10.1017/S1471068409990123

Index Terms

A compositional semantics for CHR
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
    2. General programming languages
      1. Language features
        Constraints
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

A compositional semantics for CHR
PPDP '05: Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming

Constraint Handling Rules (CHR) are a committed-choice declarative language which has been designed for writing constraint solvers. A CHR program consists of multi-headed guarded rules which allow one to rewrite constraints into simpler ones until a ...
A Compositional Semantics for CHR with Propagation Rules
Constraint Handling Rules

Constraint Handling Rules (CHR) is a committed-choice declarative language which has originally been designed for writing constraint solvers and which is nowadays a general purpose language.

In [7,11] a trace based, compositional semantics for CHR has ...
Modular, compositional, and executable formal semantics for LLVM IR

This paper presents a novel formal semantics, mechanized in Coq, for a large, sequential subset of the LLVM IR. In contrast to previous approaches, which use relationally-specified operational semantics, this new semantics is based on monadic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 10, Issue 2

February 2009

275 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/1462179

Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 March 2009

Accepted: 01 November 2007

Revised: 01 May 2007

Received: 01 March 2006

Published in TOCL Volume 10, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

Semantics

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
204
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Frühwirth T(2015)Constraint Handling Rules - What Else?Rule Technologies: Foundations, Tools, and Applications10.1007/978-3-319-21542-6_2(13-34)Online publication date: 12-Jul-2015
https://doi.org/10.1007/978-3-319-21542-6_2
HAEMMERLÉ R(2011)(Co-)Inductive semantics for Constraint Handling RulesTheory and Practice of Logic Programming10.1017/S147106841100019611:4-5(593-609)Online publication date: 6-Jul-2011
https://doi.org/10.1017/S1471068411000196
SNEYERS JVAN WEERT PSCHRIJVERS TDE KONINCK L(2009)As time goes by: Constraint Handling RulesTheory and Practice of Logic Programming10.1017/S147106840999012310:01(1-47)Online publication date: 22-Dec-2009
https://doi.org/10.1017/S1471068409990123

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents