Abstract
In this paper we present the weak looking-ahead strategy (WLA), a consistency technique on finite domains combining the computational efficiency of forward-checking with the pruning power of looking-ahead. We show that by integrating weak looking-ahead into PROLOG's SLD resolution we obtain a sound and complete inference rule, whereas standard looking-ahead itself has been shown to be incomplete. We outline how we use the weak looking-ahead technique for lathe tool selection in a CIM environment.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bernardi, H. Boley, K. Hinkelmann, P. Hanschke, C. Klauck, O. Kühn, R. Legleitner, M. Meyer, M. M. Richter, G. Schmidt, F. Schmalhofer, and W. Sommer. ARC-TEC: Acquisition, Representation and Compilation of Technical Knowledge. In Expert Systems and their Applications: Tools, Techniques and Methods, Avignon, France, 1991. Also available as Research Report RR-91-27, DFKI GmbH, P. O. Box 2080, D-6750 Kaiserslautern.
H. Boley, P. Hanschke, M. Harm, K. Hinkelmann, T. Labisch, M. Meyer, J. Müller, T. Oltzen, M. Sintek, W. Stein, and F. Steinle. μCAD2NC: A declarative lathe-workplanning model transforming CAD-like geometries into abstract NC programs. Technical Report D-91-15, DFKI GmbH, P. O. Box 2080, D-6750 Kaiserslautern, November 1991.
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. ESOP'90, pages 106–117, 1990.
J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. POPL-87, Munich, Germany, 1987.
J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(\(\mathcal{R}\)) Language and System. Technical Report CMU-CS-90-181, School of Computer Science, Carnegie Mellon University, Pittsburgh, October 1990.
A.K. Mackworth. Consistency in Networks of Relations. AI Journal, 8(1):99–118, 1977.
P. Meseguer. Constraint Satisfaction Problems: An Overview. AICOM, 2(1):3–17, 1989.
M. Meyer. Using Hierarchical Constraint Satisfaction for Lathe-Tool Selection in a CIM Environment. In Fifth International Symposium on Artificial Intelligence, pages 167–177. AAAI Press, December 1992.
M. Meyer, H.-G. Hein, and J. Müller. FIDO: Finite Domain Consistency Techniques in Logic Programming. In A. Voronkov, editor, Logic Programming: Proceedings of the 1 st and 2 nd Russian Conferences, volume 592 of LNAI, pages 294–301. Springer-Verlag, Berlin, Heidelberg, 1992.
J. Müller. Design and Implementation of a Finite Domain Constraint Logic Programming System based on PROLOG with Coroutining. Diploma thesis, Computer Science Department, University of Kaiserslautern, 1991. Also available as Technical Report D-91-02, DFKI GmbH, P. O. Box 2080, D-6750 Kaiserslautern.
P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, M.A., Müller, J.P. (1993). Finite domain consistency techniques: Their combination and application in computer-aided process planning. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-56804-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56804-9
Online ISBN: 978-3-540-47750-1
eBook Packages: Springer Book Archive