Abstract
We show how the language Constraint Handling Rules (CHR), a high-level logic language for the implementation of constraint solvers, can be slightly extended to become a general-purpose logic programming language with an expressive power subsuming the expressive ower of Horn clause programs with SLD resolution. The extended language, called “CHR∀”, retains however the extra features of CHR, e.g., committed choice and matching, which axe important for other purposes, especially for efficiently solving constraints. CHR∀ turns out to be a very flexible query language in the sense that it supports several (constraint) logic programming paradigms and allows to mix them in a single program. In particular, it supports top-down query evaluation and also bottom-up evaluation as it is frequently used in (disjunctive) deductive databases.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP'97, LNCS 1330. Springer, 1997.
S. Abdennadher and H. Schütz. Model generation with existentially quantified variables and constraints. In 6th International Conference on Algebraic and Logic Programming, LNCS 1298. Springer, 1997.
P. Brisset, T. Frühwirth, P. Lim, M. Meier, T. L. Provost, J. Schimpf, and M. Wallace. ECL i PS e 3.4 Extensions User Manual. ECRC Munich, Germany, 1994.
F. Bry and A. Yahya. Minimal model generation with positive unit hyper-resolution tableaux. In 5th Workshop on Theorem Proving with Tableaux and Related Methods, LNAI 1071. Springer, 1996.
K. Clark. Logic and Databases, chapter Negation as Failure, pages 293–322. Plenum Press, 1978.
J. Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26–36, 1988.
T. Frühwirth. Constraint handling rules. In Constraint Programming: Basics and Trends, LNCS 910. Springer, 1995.
M. J. Maher. Logic semantics for a class of committed-choice programs. In Proceedings of the Fourth International Conference on Logic Programming. The MIT Press, 1987.
R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog. In 9th Int. Conf. on Automated Deduction (CADE), LNCS 310. Springer, 1988.
D. A. Smith. Mixlog: A generalized rule based language. In Vlèmes Journées Francophones de Programmation en Logique et programmation par Contraintes. Hermes, 1997.
J. E. Wunderwald. Adding Bottom-up Evaluation to Prolog. PhD thesis, Technische Universität München, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdennadher, S., Schütz, H. (1998). CHR∀: A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 1998. Lecture Notes in Computer Science, vol 1495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055987
Download citation
DOI: https://doi.org/10.1007/BFb0055987
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65082-9
Online ISBN: 978-3-540-49655-7
eBook Packages: Springer Book Archive