An abstract machine for fixed-order dynamically stratified programs

Konstantinos Sagonas, Terrance Swift, David S. Warren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is known that a fixed computation rule, such as used in most logic programming systems, does not suffice for normal logic programs. For instance, SLS resolution, which evaluates programs according to the well-founded semantics, makes use of an oracle to determine the next literal to select in [5], and of ideal parallelism in [8]. Given these limits, it is natural to define a subclass of normal programs for which a fixed computation rule is adequate. This class, left-to-right dynamically stratified programs, properly includes other stratification classes. Left-to-right dynamically stratified programs are of interest because they are posited to be amenable to efficient implementation. We demonstrate that this is in fact the case with an implementation based on the SLG-WAM of XSB [10]. The SLG-WAM is an extension to the underlying implementation model of Prolog, the WAM, and has been shown to be extremely efficient for definite programs [13]. We show that extending the engine for left-to-right dynamically stratified programs does not slow down execution for definite programs or for Prolog-style SLD evaluation. Indeed, implementation of stratification leads to the technique of early completion which can also benefit definite programs.

Original languageEnglish (US)
Title of host publicationAutomated Deduction – Cade-13 - 13th International Conference on Automated Deduction, Proceedings
EditorsJohn K. Slaney, Michael A. McRobbie
PublisherSpringer Verlag
Pages328-342
Number of pages15
ISBN (Print)3540615113, 9783540615118
DOIs
StatePublished - Jan 1 1996
Event13th International Conference on Automated Deduction, CADE 1996 - New Brunswick, United States
Duration: Jul 30 1996Aug 3 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1104
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Automated Deduction, CADE 1996
Country/TerritoryUnited States
CityNew Brunswick
Period7/30/968/3/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An abstract machine for fixed-order dynamically stratified programs'. Together they form a unique fingerprint.

Cite this