SciDok

Eingang zum Volltext in SciDok

Lizenz

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-36547
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3654/


Weak looking-ahead and its application in computer-integrated process planning

Meyer, Manfred A. ; Müller, Jörg P.

Quelle: (1993) Kaiserslautern ; Saarbrücken : DFKI, 1993
pdf-Format:
Dokument 1.pdf (207 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Künstliche Intelligenz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer: 93-22
Sprache: Englisch
Erstellungsjahr: 1993
Publikationsdatum: 27.06.2011
Kurzfassung auf Englisch: 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.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English