Simplifying dynamic programming via mode-directed tabling

Software - Practice and Experience

Volumn 38, Issue 1, 2008, Pages 75-94

  Guo, Hai Feng ^a   Gupta, Gopal ^b  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Dynamic programming; Logic programming; Mode declaration; Tabling

Indexed keywords

AUTOMATIC PROGRAMMING; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; OPTIMAL SYSTEMS; OPTIMIZATION; RECURSIVE FUNCTIONS;

DYNAMIC PROGRAMMING PROBLEMS; MODE DECLARATION; OPTIMAL SOLUTION; TABLED LOGIC PROGRAMMING (TLP);

DYNAMIC PROGRAMMING;

EID: 38349163298     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.824     Document Type: Article

References (16)

1. Guo H-F, Gupta G. A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. Proceedings of International Conference on Logic Programming (ICLP). Springer: Berlin, 2001; 181-196.
2. Rocha R, Silva F, Costa VS, On a tabling engine that can exploit or-parallelism. Proceedings of the 17th International Conference on Logic Programming (ICLPVl), Paphos, Cyprus, 26 November-1 December 2001 (Lecture Notes in Computer Science, vol. 2237). Springer: Berlin, 2001; 166-180.
3. Sagonas K, Swift T. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Transactions on Programming Languages and Systems 1998; 20(3):586-634.
4. Zhou N-F, Shen Y, Yuan L, You J. Implementation of a linear tabling mechanism. Proceedings of Practical Aspects of Declarative Languages (PADL). Springer: Berlin, 2000.
5. Ramakrishnan YS, Ramakrishnan CR, Ramakrishnan IV. Smolka SA, Swift T, Warren DS. Efficient model checking using tabled resolution. Proceedings of the 1997 International Conference on Computer Aided Verification (CAV'97). Springer: Berlin, 1997; 143-154.
6. Swift T. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence 1999; 25(3-4):201240.
7. Chen W, Warren DS. Tabled evaluation with delaying for general logic programs. Journal of the ACM 1996; 43(1):20-74.
8. Shen Y, Yuan L, You J, Zhou N. Linear tabulated resolution based on prolog control strategy. Theory and Practice of Logic Programming 2001; 1(1):71-103.
9. Lloyd JW. Foundations of Logic Programming. Springer: Berlin, 1987.
10. Warren DS. Programming in Tabled Prolog (Draft Book), http:www.cs.sunysb.edu/~warren [April 2007].
11. XSB system, http://xsb.sourceforge.net [April 2007].
12. Specht G. Generating explanation trees even for negations in deductive database systems. Proceedings of the 5th Workshop of Logic Programming Environments. Computing Research Repository (CoRR), 1992.
13. Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms. MIT Press: Cambridge, MA, 2001.
14. Pemmasani G, Guo H-F, Dong Y, Ramakrishnan CR, Ramakrishnan IV. Online justification for tabled logic programs. Proceedings of the 7th Fuji International Symposium of Functional and Logic Programming (FLOPS 2004). Nara, Japan, 7-9 April 2004 (Lecture Notes in Computer Science, vol. 2998). Springer: Berlin. 2004; 24-38.
15. Roychoudhury A, Ramakrishnan CR, Ramakrishnan IV. Justifying proofs using memo tables. Second International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP). ACM Press: New York, 2000; 178-189.
16. Applied Logic Systems, Inc. http://www.als.com [April 2007].