Algebraic and logical semantics for CLP languages with dynamic scheduling

The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling rule. Unfortunately, this meant that programs written in a clean, declarative style were often very inefficient, only terminated when certain inputs were fully instantiated or “ground,” and (if negation...

Full description

Bibliographic Details

Published in:	The journal of logic programming Vol. 32; no. 1; pp. 71 - 84
Main Author:	Marriott, Kim
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 1997
ISSN:	0743-1066, 1873-5789
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!