Incremental Answer Completion in the SLG-WAM

  • Terrance Swift
  • Alexandre Miguel Pinto
  • Luís Moniz Pereira
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)

Abstract

The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true or false in WFS. The reason for this is that the XSB does not implement the SLG Answer Completion operation in its engine, the SLG-WAM – rather Answer Completion must be performed by post-processing the table. This engine-level omission has not proven significant for applications so far, but the need for Answer Completion is becoming important as XSB is more often used to produce well-founded residues of highly non-stratified programs. However, due to its complexity, care must be taken when adding Answer Completion to an engine. In the worst case, the cost of each Answer Completion operation is proportional to the size of a program P, so that the operation must be invoked as rarely as possible, and when invoked the operation must traverse as small a fragment as possible of P. We examine the complexity of Answer Completion; and then describe its implementation and performance in XSB’s SLG-WAM such that the invocations of the operation are restricted, and which is limited in scope to Strongly Connected Components within a tabled evaluation’s Subgoal Dependency Graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. JACM 43, 20–74 (1996)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Pereira, L.M.: G Lopes. Prospective logic agents. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS (LNAI), vol. 4874, pp. 73–86. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Sagonas, K., Swift, T.: An abstract machine for tabled execution of fixed-order stratified logic programs. TOPLAS 20(3), 586–635 (1998)CrossRefGoogle Scholar
  4. 4.
    Sagonas, K., Swift, T., Warren, D.S.: The limits of fixed-order computation. Theoretical Computer Science 254(1-2), 465–499 (2000)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Terrance Swift
    • 1
  • Alexandre Miguel Pinto
    • 1
  • Luís Moniz Pereira
    • 1
  1. 1.Centro de Inteligência ArtificialUniversidade Nova de LisboaPortugal

Personalised recommendations