Abstract
Reasoning on Constraint Handling Rules (CHR) programs and their executional behaviour is often ad-hoc and outside of a formal system. This is a pity, because CHR subsumes a wide range of important automated reasoning services. Mapping CHR to Transaction Logic (\(\mathcal{TR}\)) combines CHR rule specification, CHR rule application, and reasoning on CHR programs and CHR derivations inside one formal system which is executable. This new \(\mathcal{TR}\) semantics obviates the need for disjoint declarative and operational semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdennadher, S., Frühwirth, T., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints 4(2), 133–165 (1999)
Betz, H., Frühwirth, T.: A linear-logic semantics for Constraint Handling Rules. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 137–151. Springer, Heidelberg (2005)
Bonner, A.J., Kifer, M.: Transaction Logic programming (or, a logic of procedural and declarative knowledge). Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, Canada (1995)
Bonner, A.J., Kifer, M.: A logic for programming database transactions. In: Logics for Databases and Information Systems, pp. 117–166. Kluwer Academic Publishers, Dordrecht (1998)
Bonner, A.J., Kifer, M.: Results on reasoning about updates in Transaction Logic. In: Kifer, M., et al. (eds.) Dagstuhl Seminar 1997, DYNAMICS 1997, and ILPS-WS 1997. LNCS, vol. 1472, pp. 166–196. Springer, Heidelberg (1998)
Frühwirth, T.: Theory and Practice of Constraint Handling Rules. J. Logic Programming 37(1–3), 95–138 (1998)
Jaffar, J., et al.: The semantics of constraint logic programs. J. Logic Programming 37(1–3), 1–46 (1998)
Kifer, M.: Nonmonotonic reasoning in FLORA-2. In: Baral, C., et al. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 1–12. Springer, Heidelberg (2005)
Maher, M.J.: Logic semantics for a class of committed-choice programs. In: ICLP 87, pp. 858–876. MIT Press, Cambridge (1987)
Robin, J.: Reused Oriented Automated Reasoning Software (ROARS) project web page (2005), http://www.cin.ufpe.br/~jr/mysite/RoarsProject.html
Schrijvers, T., Frühwirth, T.: Optimal union-find in Constraint Handling Rules. J. Theory and Practice of Logic Programming 6(1-2), 213–224 (2006)
Schrijvers, T., et al.: The Constraint Handling Rules (CHR) web page (2007), http://www.cs.kuleuven.ac.be/~dtai/projects/CHR/
Thielscher, M.: FLUX: A logic programming method for reasoning agents. J. Theory and Practice of Logic Programming 5(4-5), 533–565 (2005)
Yang, G., et al.: FLORA-2: User’s Manual, Version 0.94 (Narumigata) (2005), http://flora.sourceforge.net/docs/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Meister, M., Djelloul, K., Robin, J. (2007). A Unified Semantics for Constraint Handling Rules in Transaction Logic. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)