This paper rst gives an overview of standard PROLOG indexing and then shows in a stepbystep 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 diculty of com puting 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 plusfunctional language but can easily be used in arbitrary PROLOG implementations The ideas described in this paper were rst presented at the Workshop Sprachen fu...
In this paper we present several extensions to support a more declarative view of programming in Pro...
This report describes algorithms for the compiler component of the Aurora Or-Parallel Prolog system....
© Springer-Verlag Berlin Heidelberg 2000. The WAM allows within its framework many variations e.g. r...
This paper first gives an overview of standard PROLOG indexing and then shows, in a step-by-step man...
In this paper we propose an extensible, flexible, multi-argument indexing technique for relational l...
AbstractAn implementation of PROLOG based on general clause-indexing methods using bit-serial conten...
AbstractIndexing Prolog clauses is an important optimization step that reduces the number of clauses...
This paper is a short survey about currently used implementation techniques for Prolog. It gives an ...
Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and that has be...
The paper presents a method used for querying external Database in PROLOG programming language envir...
Indexing of terms and clauses is a well-known technique used in Prolog implementations (as well as ...
We take a fresh, "clean-room" look at implementing Prolog by deriving its translation to an executab...
The authors outline an experiment on Warren abstract machine (WAM) based compiler technology. In pre...
Abstract. Indexing of terms and clauses is a well-known technique used in Prolog implementations (a...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
In this paper we present several extensions to support a more declarative view of programming in Pro...
This report describes algorithms for the compiler component of the Aurora Or-Parallel Prolog system....
© Springer-Verlag Berlin Heidelberg 2000. The WAM allows within its framework many variations e.g. r...
This paper first gives an overview of standard PROLOG indexing and then shows, in a step-by-step man...
In this paper we propose an extensible, flexible, multi-argument indexing technique for relational l...
AbstractAn implementation of PROLOG based on general clause-indexing methods using bit-serial conten...
AbstractIndexing Prolog clauses is an important optimization step that reduces the number of clauses...
This paper is a short survey about currently used implementation techniques for Prolog. It gives an ...
Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and that has be...
The paper presents a method used for querying external Database in PROLOG programming language envir...
Indexing of terms and clauses is a well-known technique used in Prolog implementations (as well as ...
We take a fresh, "clean-room" look at implementing Prolog by deriving its translation to an executab...
The authors outline an experiment on Warren abstract machine (WAM) based compiler technology. In pre...
Abstract. Indexing of terms and clauses is a well-known technique used in Prolog implementations (a...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
In this paper we present several extensions to support a more declarative view of programming in Pro...
This report describes algorithms for the compiler component of the Aurora Or-Parallel Prolog system....
© Springer-Verlag Berlin Heidelberg 2000. The WAM allows within its framework many variations e.g. r...