Abstract
In this paper we discuss different implementation for FIDO, a logic programming language with finite domain constraints and consistency techniques. These approaches range from meta-interpretation over horizontal compilation (source-to-source transformation) through vertical compilation down to an extended Warren Abstract Machine. We will stress the horizontal compilation approach which already shows promising results, whereas the deeper integration on a lower implementation layer by extending the unification and control instructions of the WAM will finally give much better performance results.
The work of the first author is carried out as part of the ARC-TEC project, supported by BMFT under grant ITW 8902 C4.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Boley, P. Hanschke, K. Hinkelmann, and M. Meyer. COLAB: A Hybrid Knowledge Compilation Laboratory. Annals of Operations Research, 1992.
M. Carlsson. Freeze, Indexing, and Other Implementation Issues in the WAM. In J.-L. Lassez, editor, Proc. ICLP-87, Melbourne, Australia, May 1987. MIT Press.
A. Colmerauer. Opening the Prolog III Universe. BYTE, pages 177–182, August 1987.
D. de Schreye, D. Pollet, J. Ronsyn, and M. Bruynooghe. Implementing Finite-domain Constraint Logic Programming on Top of a PROLOG-System with Delay-mechanism. In N. Jones, editor, Proc. of ESOP 90, pages 106–117, 1990.
M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proc. FGCS'88, Tokyo, December 1988.
H.-G. Hein. Consistency Techniques in WAM-based Architectures. Master's thesis, Univ. Kaiserslautern, FB Informatik, Postfach 3049, D-6750 Kaiserslautern, 1991. Forthcoming.
H.-G. Hein and M. Meyer. A WAM Compilation Scheme. In Proceedings of the 2 nd Russian Conference on Logic Programming. Lecture Notes in AI, Springer-Verlag, Heidelberg, 1991.
Ch. Holzbaur. Realization of Forward Checking in Logic Programming through Extended Unification. Technical Report TR-90-11, Austrian Research Institute for Artifical Intelligence, June 1990.
J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. POPL-87, Munich, Germany, 1987.
M. Meier, A. Aggoun, D. Chan, P. Dufresne, R. Enders, D.H. de Villeneuve, A. Herold, P. Kay, B. Perez, E. van Rossum, and J. Schimpf. SEPIA — An Extendible Prolog System. In G. Ritter, editor, Proc. IFIP 11th World Computer Congress, pages 1127–1132, 1989.
M. Meyer and C. Jakfeld. CONTAX — A Constraint System over Taxonomies. ARC-TEC Discussion Paper 91-04, DFKI GmbH, P. O. Box 20 80, Kaiserslautern, Germany, 1991.
J. Müller. Design and Implementation of a Finite Domain Constraint Logic Programming System based on PROLOG with Coroutining. Master's thesis, Universität Kaiserslautern, FB Informatik, Postfach 3049, D-6750 Kaiserslautern, 1991. Forthcoming.
S. Schrödl. FIDO: Ein Constraint-Logic-Programming-System mit Finite Domains. ARC-TEC Discussion Paper 91-5, DFKI GmbH, P. 0. Box 2080, Kaiserslautern, Germany, 1991.
P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, M., Hein, H.G., Müller, J. (1992). FIDO: Finite domain consistency techniques in logic programming. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive