XSB: Extending Prolog with tabled logic programming

Terrance Swift, David S. Warren

Research output: Contribution to journalArticle

Abstract

The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However, the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result, TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in the XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.

Original languageEnglish (US)
Pages (from-to)157-187
Number of pages31
JournalTheory and Practice of Logic Programming
Volume12
Issue number1-2
DOIs
StatePublished - Jan 1 2012

Keywords

  • Prolog
  • implementation
  • non-monotonic reasoning
  • tabling

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'XSB: Extending Prolog with tabled logic programming'. Together they form a unique fingerprint.

  • Cite this