A new formulation of tabled resolution with delay

Terrance Swift

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

Abstract

Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGx, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGx is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.

Original languageEnglish (US)
Title of host publicationProgress in Artificial Intelligence - 9th Portuguese Conference on Artificial Intelligence, EPIA 1999, Proceedings
EditorsPedro Barahona, José J. Alferes
PublisherSpringer Verlag
Pages163-177
Number of pages15
ISBN (Print)354066548X, 9783540665489
DOIs
StatePublished - Jan 1 1999
Event9th Portuguese Conference on Progress in Artificial Intelligence, EPIA 1999 - Evora, Portugal
Duration: Sep 21 1999Sep 24 1999

Publication series

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

Other

Other9th Portuguese Conference on Progress in Artificial Intelligence, EPIA 1999
CountryPortugal
CityEvora
Period9/21/999/24/99

Keywords

  • Logic programming
  • Non-Monotonic reasoning

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A new formulation of tabled resolution with delay'. Together they form a unique fingerprint.

Cite this