Abstract
This work presents a general meta CLP architecture which can be built by adding CLP solvers as meta levels reasoning on the constraints of the underlying object system. We propose two specializations on finite domains: the first concerns the possibility of embedding the capability of performing qualitative reasoning in a CLP framework, while the second concerns a multi-level architecture for obtaining different degrees of consistency by using weaker algorithms.
This is a preview of subscription content, log in via an institution.
References
J.Jaffar, J.L.Lassez, “Constraint Logic Programming”, in Proceedings of the Conference on Principle of Programming Languages, Munich 1987.
J.Jaffar, M.J.Maher, “Constraint Logic Programming: a Survey”, in Journal of Logic Programming on 10 years of Logic Programming, 1994.
E.Lamma, P.Mello, M.Milano, “A Meta Constraint Logic Programming Scheme”, Tech. Report DEIS-LIA-95-005, Bologna University, 1995.
P.Van Beek, “Reasoning about Qualitative Temporal Information”, in Artificial Intelligence, Vol. 58, 1992, pp. 297–326.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamma, E., Mello, P., Milano, M. (1996). A meta constraint logic programming architecture (extended abstract). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_110
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive