AbstractA model for the coroutined execution of PROLOG programs is presented, and two control primitives are described. Heuristics for the control of data-base and recursive procedures are given, which lead to algorithms for generating control information. These algorithms can be incorporated into a preprocessor for logic programs. It is argued that automatic generation should be an important consideration when designing control primitives and is a significant step towards simplifying the task of programming
We extend a technique called Compiling Control. The technique transforms coroutining logic programs ...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
We present the implementation of a Prolog system composed of interpreter and compiler. The originali...
AbstractA model for the coroutined execution of PROLOG programs is presented, and two control primit...
In the past, a lot of research has been done on obtaining efficient execution of programs which are ...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
AbstractWe give a formal description of a new transformation technique for declarative Horn clause p...
Centre for Intelligent Systems and their ApplicationsThe coneptual distinction between logic and co...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
A basic requirement of declarative programming is to free the program-mer from the need to manually ...
Recent work has provided delimited control for Prolog to dynamically manipulate the program control-...
A long-standing problem in logic programming is how to cleanly separate logic and control. While sol...
The objective of control generation in logic programming is to automatically derive a computation ru...
We extend a technique called Compiling Control. The technique transforms coroutining logic programs ...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
We present the implementation of a Prolog system composed of interpreter and compiler. The originali...
AbstractA model for the coroutined execution of PROLOG programs is presented, and two control primit...
In the past, a lot of research has been done on obtaining efficient execution of programs which are ...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
AbstractWe give a formal description of a new transformation technique for declarative Horn clause p...
Centre for Intelligent Systems and their ApplicationsThe coneptual distinction between logic and co...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
A basic requirement of declarative programming is to free the program-mer from the need to manually ...
Recent work has provided delimited control for Prolog to dynamically manipulate the program control-...
A long-standing problem in logic programming is how to cleanly separate logic and control. While sol...
The objective of control generation in logic programming is to automatically derive a computation ru...
We extend a technique called Compiling Control. The technique transforms coroutining logic programs ...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
We present the implementation of a Prolog system composed of interpreter and compiler. The originali...