Just enough tabling

Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04

Volumn , Issue , 2004, Pages 78-89

  Sagonas, Konstantinos ^a   Stuckey, Peter J ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Logic programming; Pruning; Suspension resumption in the WAM; Tabling

Indexed keywords

COMPUTER SOFTWARE; INTEGRATION; MATHEMATICAL MODELS; PROBLEM SOLVING; PROLOG (PROGRAMMING LANGUAGE); SEMANTICS;

JUST ENOUGH TABLING (JET); PRUNING; RECOMPUTATION; SUSPENSION/RESUMPTION IN THE WAM;

LOGIC PROGRAMMING;

EID: 11244267187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013963.1013975     Document Type: Conference Paper

References (15)

1. L. F. Castro, T. Swift, and D. S. Warren. Suspending and resuming computations in engines for SLG evaluation. In S. Krishnamurthi and C. R. Ramakrishnan, editors, Practical Applications of Declarative Languages: Proceedings of the PADL'2002 Symposium, number 2257 in LNCS, pages 332-350. Springer, Jan. 2002.
2. L. F. Castro and D. S. Warren. Approximate pruning in tabled logic programming. In P. Degano, editor, Programming Languages and Systems: Proceedings of the European Symposium on Programming, number 2618 in LNCS, pages 69-83. Springer, Apr. 2003.
3. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1):20-74, Jan. 1996.
4. B. Demoen and K. Sagonas. CHAT is ⊖(SLG-WAM). In H. Ganzinger, D. McAllester, and A. Voronkov, editors, LPAR'99: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, number 1705 in LNAI, pages 337-357. Springer, Sept. 1999.
5. B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. Future Generation Computer Systems, 16(7):809-830, May 2000.
6. H.-F. Guo and G. Gupta. A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In P. Codognet, editor, Proceedings of the 17th International Conference on Logic Programming, number 2237 in LNCS, pages 181-196. Springer, Nov./Dec. 2001.
7. H.-F. Guo and G. Gupta. Cuts in tabled logic programming. In B. Demoen, editor, Proceedings of CICLOPS'2002, the Colloquium on Implementation of Constraint and LOgic Programming Systems, pages 62-73, July 2002.
8. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient access mechanisms for tabled logic programs. J. of Logic Program., 38(1):31-54, Jan. 1999.
9. R. Rocha, F. Silva, and V. Santos Costa. YapTab: A tabling engine designed to support parallelism. In Proceedings of Tabulation in Parsing and Deduction (TAPD), pages 77-87, Sept. 2000.
10. K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Trans. Prog. Lang. Syst., 20(3):586-634, May 1998.
11. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442-453. ACM Press, May 1994.
12. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. of Logic Program., 26(1-3): 17-64, Oct./Dec. 1996.
13. H. Tamaki and T. Sato. OLD resolution with Tabulation. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, number 225 in LNCS, pages 84-98. Springer-Verlag, July 1986.
14. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U.S.A., Oct. 1983.
15. N.-F. Zhou, Y.-D. Shen, L.-Y. Yuan, and J.-H. You. Implementation of a linear tabling mechanism. J. of Functional and Logic Program., 2001(10), 2001.