Tabling for non‐monotonic programming

  title={Tabling for non‐monotonic programming},
  author={T. Swift},
  journal={Annals of Mathematics and Artificial Intelligence},
  • T. Swift
  • Published 2004
  • Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • Non‐monotonic extensions add power to logic programs. However, the main logic programming language, Prolog, is widely recognized as inadequate to implement these extensions due to its weak termination and complexity properties. By extending Prolog’s SLD resolution with tabling, Prolog can be improved in several ways. Tabling can allow a logic programming system to compute the well‐founded semantics for programs with bounded term depth, and to do so with polynomial data complexity. By exploiting… CONTINUE READING
    84 Citations
    XSB: Extending Prolog with Tabled Logic Programming
    • 178
    • PDF
    An Extended Semantics for Logic Programs with Annotated Disjunctions and its Efficient Implementation
    • 7
    • PDF
    Tabling with Sound Answer Subsumption
    • 5
    • PDF
    Stable versus Layered Logic Program Semantics
    • 5
    • PDF
    Tabling with Answer Subsumption: Implementation, Applications and Performance
    • 39
    • PDF
    Stabel Model Implementation of Layer Supported Models by Program Transformation
    • 5
    • PDF
    Termination of logic programs with imperfect information: applications and query procedure
    • 37
    • PDF


    Semantics-based program analysis for logic-based languages using XSB
    • 25
    A logic programming system for nonmonotonic reasoning
    • 59
    A New Formulation of Tabled Resolution with Delay
    • 23
    Efficient Access Mechanisms for Tabled Logic Programs
    • 110
    • PDF
    The limits of fixed-order computation
    • 16
    Well-founded Abduction via Tabled Dual Programs
    • 35
    • PDF
    An Abstract Machine for Computing the Well-Founded Semantics
    • 39
    • PDF