Prolog control rules

Authors:
Lee Naish
Affiliations:
Department of Computer Science, University of Melbourne, Parkville, Australia
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 2
Cited 1

Automating control for logic programs

Journal of Logic Programming
Efficient processing of interactive relational data base queries expressed in logic

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

On the transformation of logic programs with instantiation based computation rules

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an overview of the many control constructs and heuristics used by PROLOG systems with extra control facilities. Two features of computations rules are used to evaluate and classify them. They are detecting failure quickly (where it is unavoidable) and avoiding failures. By examining current systems in this light, we reach conclusions concerning deficiencies in performance, and how they may be overcome. We propose an idealized computation rule which uses a hierarchy of goals and a breadth first component.