Mode-directed tabling for dynamic programming, machine learning, and constraint solving

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2, Issue , 2010, Pages 213-218

  Zhou, Neng Fa ^a   Kameya, Yoshitaka ^b   Sato, Taisuke ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; APPLICATION EXAMPLES; CARDINALITIES; CONSTRAINT SOLVING; HAMILTON CYCLE; HYDRAULIC SYSTEM; MACHINE-LEARNING; PROGRAMMING PROBLEM; SUBGOALS; VITERBI;

ARTIFICIAL INTELLIGENCE; COMPUTER SYSTEMS PROGRAMMING; HYDRAULIC EQUIPMENT; HYDRAULIC MACHINERY; LEARNING SYSTEMS; PRISMS; PROBABILISTIC LOGICS; VITERBI ALGORITHM;

DYNAMIC PROGRAMMING;

EID: 78751538149     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2010.103     Document Type: Conference Paper

References (25)

1. H. Tamaki and T. Sato, "OLD resolution with tabulation," in Proceedings International Conference on Logic Programming (ICLP), 1986, pp. 84-98.
2. D. S. Warren, "Memoing for logic programs," Comm. of the ACM, Special Section on Logic Programming, vol. 35, pp. 93-111, 1992.
3. N.-F. Zhou, T. Sato, and Y.-D. Shen, "Linear tabling strategies and optimizations," Theory and Practice of Logic Programming (TPLP), vol. 8, no. 1, pp. 81-109, 2008.
4. T. Swift, D. S. Warren et al., "The XSB Programmer's Manual: version 3.2, vols. 1 and 2," 2009, http://xsb.sf.net.
5. H.-F. Guo and G. Gupta, "Simplifying dynamic programming via mode-directed tabling," Softw., Pract. Exper., vol. 38, no. 1, pp. 75-94, 2008.
6. T. Sato and Y. Kameya, "Parameter learning of logic programs for symbolic-statistical modeling," Journal of Artificial Intelligence Research, pp. 391-454, 2001.
7. T. Sato, Y. Kameya, and et. al., "The PRISM user's manual," March 2010, http://www.mi.cs.titech.ac.jp/prism/.
8. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," Proceedings of the Royal Statistical Society, pp. 1-38, 1976.
9. H. Christiansen and J. P. Gallagher, "Non-discriminating arguments and their uses," in Proceedings International Conference on Logic Programming (ICLP), 2009, pp. 55-69.
10. N.-F. Zhou, "B-Prolog users manual," 2010, http://www.probp. com/.
11. J. Freire, T. Swift, and D. S. Warren, "Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies," Journal of Functional and Logic Programming, 1998.
12. K. Sagonas and T. Swift, "An abstract machine for tabled execution of fixed-order stratified logic programs," ACM Transactions on Programming Languages and Systems, vol. 20, no. 3, pp. 586-634, 1998.
13. R. Rocha, F. Silva, and V. S. Costa, "The YapTab tabling system," Draft paper, 2010.
14. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recoginition," Proceedings of the IEEE, vol. 77, pp. 257-286, 1989.
15. H. Christiansen and O. T. Lassen, "Preprocessing for optimization of probabilistic-logic models for sequence analysis," in Proceedings International Conference on Logic Programming (ICLP), 2009, pp. 70-83.
16. J. Sneyers, J. Vennekens, and D. De Schreye, "Probabilistic-logical modeling of music," in Proceedings of Practical Aspects of Declarative Languages (PADL), 2006, pp. 60-72.
17. J. Eisner, E. Goldlust, and N. A. Smith, "Compiling Comp Ling: weighted dynamic programming and the Dyna language," in Proc. of Human Language Technology Conf. and Conf. on Empirical Methods in Natural Language Processing (HLT-EMNLP), 2005, pp. 281-290.
18. W. Chen and D. S. Warren, "Tabled evaluation with delaying for general logic programs," Journal of the ACM, vol. 43, no. 1, pp. 20-74, 1996.
19. M. Gelfond and V. Lifschitz, "The stable model semantics for logic programming," in Proceedings International Conference on Logic Programming (ICLP/SLP), 1988, pp. 1070-1080.
20. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and S. Thiele, "A User's Guid to gringo, clasp, clingo and iclingo," University of Potsdam, Tech. Rep., 2008.
21. P. Simons, I. Niemelä, and T. Soininen, "Extending and implementing the stable model semantics," Artif. Intell., vol. 138, no. 1-2, pp. 181-234, 2002.
22. A. D. Palù, A. Dovier, E. Pontelli, and G. Rossi, "Answer set programming with constraints using lazy grounding," in Proceedings International Conference on Logic Programming (ICLP), 2009, pp. 115-129.
23. S. Greco, C. Molinaro, I. Trubitsyna, and E. Zumpano, "NP Datalog: a Logic Language for Expressing NP Search and Optimization Problems," Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules, vol. 10, no. 2, pp. 125-166, 2010.
24. N.-F. Zhou, "Programming finite-domain constraint propagators in action rules," Theory and Practice of Logic Programming (TPLP), vol. 6, no. 5, pp. 483-508, 2006.
25. D. Saha and C. R. Ramakrishnan, "A local algorithm for incremental evaluation of tabled logic programs," in Proceedings International Conference on Logic Programming (ICLP), 2006, pp. 56-71.