Please use this identifier to cite or link to this item: doi:10.22028/D291-25044
Title: Indexing PROLOG procedures into DAGs by heuristic classification
Author(s): Sintek, Michael
Language: English
Year of Publication: 1993
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1993
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: This paper first gives an overview of standard PROLOG indexing and then shows, in a step-by-step manner, how it can be improved by slightly extending the WAM indexing instruction set to allow indexing on multiple arguments. Heuristics are described that overcome the difficulty of computing the indexing WAM code. In order to become independent from a concrete WAM instruction set, an abstract graphical representation based on DAGs (called DAXes) is introduced. The paper includes a COMMON LISP listing of the main heuristics implemented; the algorithms were developed for RELFUN, a relational-plus-functional language, but can easily be used in arbitrary PROLOG implementations.
Link to this record: urn:nbn:de:bsz:291-scidok-38882
Series name: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Series volume: 93-05
Date of registration: 7-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
TM_93_05.pdf385,41 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.