Tabling with answer subsumption: Implementation, applications and performance

Terrance Swift, David S. Warren

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

Abstract

Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages300-312
Number of pages13
Volume6341 LNAI
DOIs
StatePublished - 2010
Externally publishedYes
Event12th European Conference on Logics in Artificial Intelligence, JELIA 2010 - Helsinki, Finland
Duration: Sep 13 2010Sep 15 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6341 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th European Conference on Logics in Artificial Intelligence, JELIA 2010
CountryFinland
CityHelsinki
Period9/13/109/15/10

Fingerprint

Logic programming
Semantics
Table
Logic Programming
Scalability
Partial Order
Logic
Well-founded Semantics
Domain Analysis
Prolog
Semilattice
Termination
Join

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Swift, T., & Warren, D. S. (2010). Tabling with answer subsumption: Implementation, applications and performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6341 LNAI, pp. 300-312). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6341 LNAI). https://doi.org/10.1007/978-3-642-15675-5_26

Tabling with answer subsumption : Implementation, applications and performance. / Swift, Terrance; Warren, David S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6341 LNAI 2010. p. 300-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6341 LNAI).

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

Swift, T & Warren, DS 2010, Tabling with answer subsumption: Implementation, applications and performance. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6341 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6341 LNAI, pp. 300-312, 12th European Conference on Logics in Artificial Intelligence, JELIA 2010, Helsinki, Finland, 9/13/10. https://doi.org/10.1007/978-3-642-15675-5_26
Swift T, Warren DS. Tabling with answer subsumption: Implementation, applications and performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6341 LNAI. 2010. p. 300-312. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-15675-5_26
Swift, Terrance ; Warren, David S. / Tabling with answer subsumption : Implementation, applications and performance. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6341 LNAI 2010. pp. 300-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cedfaf2aa9624fbe8d69d286b6f21bd3,
title = "Tabling with answer subsumption: Implementation, applications and performance",
abstract = "Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.",
author = "Terrance Swift and Warren, {David S.}",
year = "2010",
doi = "10.1007/978-3-642-15675-5_26",
language = "English (US)",
isbn = "3642156746",
volume = "6341 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "300--312",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Tabling with answer subsumption

T2 - Implementation, applications and performance

AU - Swift, Terrance

AU - Warren, David S.

PY - 2010

Y1 - 2010

N2 - Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.

AB - Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.

UR - http://www.scopus.com/inward/record.url?scp=78049400748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049400748&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15675-5_26

DO - 10.1007/978-3-642-15675-5_26

M3 - Conference contribution

AN - SCOPUS:78049400748

SN - 3642156746

SN - 9783642156748

VL - 6341 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 300

EP - 312

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -