Document Open Access Logo

A New Proof-Theoretical Linear Semantics for CHR

Author Igor Stéphan

PDF
Thumbnail PDF

File

OASIcs.ICLP.2018.4.pdf
  • Filesize: 0.49 MB
  • 17 pages

Document Identifiers

Author Details

Igor Stéphan
  • LERIA, Université d'Angers, France

Cite AsGet BibTex

Igor Stéphan. A New Proof-Theoretical Linear Semantics for CHR. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/OASIcs.ICLP.2018.4

Abstract

Constraint handling rules are a committed-choice language consisting of multiple-heads guarded rules that rewrite constraints into simpler ones until they are solved. We propose a new proof-theoretical declarative linear semantics for Constraint Handling Rules. We demonstrate completeness and soundness of our semantics w.r.t. operational omega_t. semantics. We propose also a translation from this semantics to linear logic.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
Keywords
  • Constraint Handling Rules
  • Linear Logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. S. Abdennadher. Operational Semantics and Confluence of Constraint Propagation Rules. In Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP'97), pages 252-266, 1997. Google Scholar
  2. S. Abdennadher and H. Schütz. CHR^∀: A Flexible Query Language. In Proceedings of the 3^rd International Conference on Flexible Query Answering Systems, pages 1-14, 1998. Google Scholar
  3. J.M. Andreoli. Logic Programming with Focusing Proofs in Linear Logic. Journal of logic and computation, 2(3):297-347, 1992. Google Scholar
  4. H. Betz. A linear-logic semantics for constraint handling rules With Disjunction. In Proceedings of the 4th Workshop on Constraint Handling Rules (CP'07), pages 17-31, 2007. Google Scholar
  5. H. Betz. A Unified Analytical Foundation for Constraint Handling Rules, PhD thesis, Ulm University, 2014. Google Scholar
  6. H. Betz and T.W. Frühwirth. A Linear-Logic Semantics for Constraint Handling Rules. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP'05), pages 137-151, 2005. Google Scholar
  7. H. Betz and T.W. Frühwirth. Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. ACM Transactions on Computational Logic, 14(1), 2013. Google Scholar
  8. G.J. Duck, P.J. Stuckey, M.G. de la Banda, and C. Holzbaur. The Refined Operational Semantics of Constraint Handling Rules. In Proceedings of the 20th International Conference on Logic Programming (ICLP'04), pages 90-104, 2004. Google Scholar
  9. T.W. Frühwirth. Constraint Handling Rules. Technical report, ECRC, 1992. Google Scholar
  10. T.W. Frühwirth. Constraint Handling Rules. In Constraint Programming: Basics and Trends, pages 90-107, 1994. Google Scholar
  11. T.W. Frühwirth. Theory and Practice of Constraint Handling Rules. Journal of Logic Programming, 37(1-3):95-138, 1998. Google Scholar
  12. T.W. Frühwirth. Constraint Handling Rules. Cambridge University Press, 2009. Google Scholar
  13. T.W. Frühwirth and S. Abdennadher. Essentials of Constraint Programming. Springer-Verlag, 2003. Google Scholar
  14. T.W. Frühwirth and F. Raiser, editors. Constraint Handling Rules: Compilation, Execution, and Analysis. Books on Demand, March 2011. Google Scholar
  15. Jean-Yves Girard. Linear Logic. Theoretical Computer Science, 50:1-102, 1987. Google Scholar
  16. P. Van Hentenryck. Constraint logic programming. Knowledge Engineering Review, 6(3):151-194, 1991. Google Scholar
  17. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages, pages 111-119, 1987. Google Scholar
  18. J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503-581, 1994. Google Scholar
  19. F. Raiser, H. Betz, and Thom Frühwirth. Equivalence of CHR states revisited. In Proceedings of the 6^th International Workshop on Constraint Handling Rules, pages 34-48, 2009. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact