Describes techniques for reversing the direction of a planning problem and for measuring the directional bias of a planner, and uses these techniques to gain some insight into planning directionality issues. (The link above is in University of Oregon Technical Report format, and is recommended for most readers. The work is also available in official U. Oregon dissertation format if you want to make your eyes bleed.)
Describes a method of transforming a committed-choice logic program into a sequential imperative program, in order to improve execution efficiency on uniprocessor machines.
Describes a method for oversequentializing committed-choice logic programs which allows reparallelizing at run-time in response to deadlock or processor availability.
Describes a method of executing committed-choice logic programs in a ``demand-driven'' fashion. The revised semantics increase the declarativity of the language and allow efficient implementation.
Gives a description of clause matching in committed choice languages in terms of clause matching automata, describes how to optimize these automata for more efficient matching, and gives an implementation technique which allows efficient implementation of the optimized automata.
Describes a compiler intermediate form potentially useful for both dataflow and concurrent logic programs, which allows automatically partitioning the program into sequentially executable pieces.
Describes a compiler intermediate form potentially useful for both dataflow and concurrent logic programs, which allows automatically partitioning the program into sequentially executable pieces.
Describes our overall experiences with the Super Monaco system, concentrating on the optimizing compiler and its interaction with the runtime.