Dedicated tabling for a probabilistic setting

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 7, Issue , 2010, Pages 124-133

  Mantadelis, Theofrastos ^a   Janssens, Gerda ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY CONSUMPTION; PROBABILISTIC FRAMEWORK; PROBABILITY INFERENCE; PROOF TREE; SUB-COMPUTATIONS; SUM OF PRODUCTS;

FORESTRY; LOGIC PROGRAMMING; PROBABILITY;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84880229953     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.ICLP.2010.124     Document Type: Conference Paper

References (17)

1. Sheldon B. Akers. Binary decision diagrams. IEEE Trans. Computers, 27(6):509-516, 1978.
2. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers, 35(8):677-691, 1986.
3. Weidong Chen and David S.Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, 1996.
4. Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. ProbLog: A probabilistic prolog and its application in link discovery. In Proceedings of IJCAI, pages 2462-2467, 2007.
5. Edward Fredkin. Trie Memory. Communications of the ACM, 3:490-499, 1962.
6. Hai-Feng Guo, C. R. Ramakrishnan, and I. V. Ramakrishnan. Speculative beats conservative justification. In Proceedings of ICLP, pages 150-165, 2001.
7. Angelika Kimmig, Bernd Gutmann, and Vítor Santos Costa. Trading memory for answers: Towards tabling ProbLog. In Proceedings of SRL, 2009.
8. Angelika Kimmig, Vítor Santos Costa, Ricardo Rocha, Bart Demoen, and Luc De Raedt. On the efficient execution of ProbLog programs. In Proceedings of ICLP, pages 175-189, 2008.
9. Theofrastos Mantadelis and Gerda Janssens. Tabling relevant parts of SLD proofs for ground goals in a probabilistic setting. In Proceedings of CICLOPS, 2009.
10. Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, and I. V. Ramakrishnan. Online justification for tabled logic programs. In LNCS: Logic Programming, pages 500-501, 2003.
11. Prasad Rao, Konstantinos F. Sagonas, Terrance Swift, David S. Warren, and Juliana Freire. XSB: A system for efficiently computing wfs. In Proceedings of LPNMR, pages 431-441, 1997.
12. Ricardo Rocha, Fernando Silva, and V-tor Santos Costa. A Tabling Engine for the Yap Prolog System. In Proceedings of AGP, 2000.
13. Taisuke Sato. A statistical learning method for logic programs with distribution semantics. In Proceedings of ICLP, pages 715-729. MIT Press, 1995.
14. Taisuke Sato and Yoshitaka Kameya. Parameter learning of logic programs for symbolic-statistical modeling. JAIR, 15:391-454, 2001.
15. Taisuke Sato and Yoshitaka Kameya. Statistical abduction with tabulation. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, pages 567-587, 2002.
16. Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Kimmo Kulovesi, and Hannu Toivonen. Link discovery in graphs derived from biological databases. In Proceedings of DILS, pages 35-49, 2006.
17. Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.