Please use this identifier to cite or link to this item:
|Title:||Weak looking-ahead and its application in computer-integrated process planning|
|Author(s):||Meyer, Manfred A.|
Müller, Jörg P.
|Year of Publication:||1993|
|OPUS Source:||Kaiserslautern ; Saarbrücken : DFKI, 1993|
|SWD key words:||Künstliche Intelligenz|
|DDC notations:||004 Computer science, internet|
|Abstract:||Constraint logic programming has been shown to be a very useful tool for knowledge representation and problem-solving in different areas. Finite Domain extensions of PROLOG together with efficient consistency techniques such as forward-checking and looking-ahead make it possible to solve many discrete combinatorial problems within a short development time. In this paper we present the weak looking-ahead strategy (WLA), a new consistency technique on finite domains combining the computational efficiency of forward-checking with the pruning power of looking-ahead. Moreover, incorporating weak looking-ahead into PROLOG's SLD resolution gives a sound and complete inference rule whereas standard looking-ahead itself has been shown to be incomplete. Finally, we will show how to use weak looking-ahead in a real-world application to obtain an early search-space pruning while avoiding the control overhead involved by standard looking-ahead.|
|Link to this record:||urn:nbn:de:bsz:291-scidok-36547|
|Series name:||Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]|
|Date of registration:||27-Jun-2011|
|Faculty:||SE - Sonstige Einrichtungen|
|Department:||SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz|
|Collections:||SciDok - Der Wissenschaftsserver der Universität des Saarlandes|
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.