Prolog performance on larger datasets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4354 LNCS, Issue , 2007, Pages 185-199

  Costa, Vítor Santos ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE AMOUNTS OF DATA; LARGE DATASETS; LOGIC PROGRAMMING SYSTEMS; LOGIC-BASED REPRESENTATION; MAIN MEMORY; REAL DATA SETS; SCALABALITY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

LOGIC PROGRAMMING;

EID: 84887342039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69611-7-12     Document Type: Conference Paper

References (34)

1. H. Aït-Kaci. Warren's Abstract Machine - A Tutorial Reconstruction. MIT Press, 1991.
2. G. A.P., H. M., M. S., B. D., E. S.J., and B. P.O. Genomic expression responses to DNA-damaging agents and the regulatory role of the yeast ATR homolog Mec1p. Mol Biol Cell., 12: 2987-3003, 2001.
3. G. A.P., S. P.T., K. C.M., C.-H. O., E. M.B., S. G., B. D., and P. Brown. Genomic expression programs in the response of yeast cells to environmental changes. Mol Biol Cell., 11: 4241-57, 2000.
4. K. Appleby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6): 171-183, 1989.
5. J. R. Bell. Threaded code. Communications of the ACM, 16(6): 370-372, 1973.
6. W. Benton. Personal communication, 2006.
7. K. Casey, D. Gregg, M. A. Ertl, and A. Nisbet. Towards superinstructions for java interpreters. In A. Krall, editor, Software and Compilers for Embedded Systems, 7th International Workshop, SCOPES 2003, Vienna, Austria, September 24-26, 2003, Proceedings, Volume 2826 of Lecture Notes in Computer Science, pages 329-343. Springer, 2003.
8. L. F. Castro and V. Santos Costa. Understanding Memory Management in Prolog Systems. In Proceedings of Logic Programming, 17th International Conference, ICLP 2001, Volume 2237 of Lecture Notes in Computer Science, pages 11-26, Paphos, Cyprus, November 2001.
9. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1): 20-74, January 1996.
10. J. Davis, E. S. Burnside, I. Dutra, D. Page, R. Ramakrishnan, V. S. Costa, and J. W. Shavlik. View learning for statistical relational learning: With an application to mammography. In L. P. Kaelbling and A. Saffiotti, editors, IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005, pages 677-683. Professional Book Center, 2005.
11. B. Demoen. A different look at garbage collection for the wam. In P. J. Stuckey, editor, Logic Programming, 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29 - August 1, 2002, Proceedings, Volume 2401 of Lecture Notes in Computer Science, pages 179-193. Springer, 2002.
12. B. Demoen and P.-L. Nguyen. So Many WAM Variations, So Little Time. In LNAI 1861, Proceedings Computational Logic - CL 2000, pages 1240-1254. SpringerVerlag, July 2000.
13. Fellbaum. WordNet: An Electronic Lexical Database (Language, Speech, and Communication). The MIT Press, May 1998.
14. M. Ferreira and R. Rocha. Coupling optyap with a database system. In N. Guimarães and P. T. Isaías, editors, AC 2005, Proceedings of the IADIS International Conference on Applied Computing, Algarve, Portugal, February 22-25, 2005, 2 Volumes, pages 107-114. IADIS, 2005.
15. M. Goadrich, L. Oliphant, and J. Shavlik. Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction. In Proceedings of the 14th International Conference on Inductive Logic Programming, Porto, Portugal, 2004.
16. H.-F. Guo and G. Gupta. A Simple Technique for Implementing Tabling based on Dynamic Reordering of Alternatives. In Proceedings of ICLP'01, November 2001.
17. S. Kok and P. Domingos. Learning the structure of markov logic networks. In Proceedings of the Twenty-Second International Conference on Machine Learning, pages 441-448. ACM Press, 2005.
18. T. G. Lindholm and R. A. O'Keefe. Efficient implementation of a defensible semantics for dynamic Prolog code. In J.-L. Lassez, editor, Proceedi ngs of the Fourth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 21-39. University of Melbourne, "MIT Press,", May 1987.
19. A. McCallum, K. Nigam, J. Rennie, and K. Seymore. Automating the construction of internet portals with machine learning. Information Retrieval Journal, 3: 127-163, 2000. www.research.whizbang.com/data.
20. P. McJonese. Eachmovie collaborative filtering data set. Technical report, DEC Systems Research Center, 1997.
21. J. F. Morales, M. Carro, G. Puebla, and M. V. Hermenegildo. A generator of efficient abstract machine implementations and its application to emulator minimization. In M. Gabbrielli and G. Gupta, editors, Logic Programming, 21st International Conference, ICLP 2005, Volume 3668 of Lecture Notes in Computer Science, pages 21-36. Springer, 2005.
22. H. Nässén, M. Carlsson, and K. F. Sagonas. Instruction merging and specialization in the sicstus prolog virtual machine. In Proceedi ngs of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, September 5-7, 2001, Florence, Italy, pages 49-60. ACM, 2001.
23. H. Nilsson. The external database in sicstus prolog. In A. Voronkov, editor, Logic Programming and Automated Reasoning: Proc. of the International Conference LPAR'92, pages 493-495. Springer, Berlin, Heidelberg, 1992.
24. I. Ong, D. Page, and V. S. Costa. Inferring Regulatory Networks from Time Series Expression Data and Relational Data via Inductive Logic Programming. In Inductive Logic Programming Meeting, 2006.
25. S. Ray and M. Craven. Representing sentence structure in hidden markov models for information extraction. In B. Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001, pages 1273-1279. Morgan Kaufmann, 2001.
26. R. Rocha, F. Silva, and V. S. Costa. On Applying Or-Parallelism and Tabling to Logic Programs. Theory and Practice of Logic Programming Systems, 5(1-2): 161-205, 2005.
27. K. F. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Transactions on Programming Languages and Systems, 20(3): 586-634, May 1998.
28. V. Santos Costa. Performance Issues in Prolog Applications. In Portuguese Conference on Artificial Intelligence (EPIA), Volume 2902 of Lecture Notes in Computer Science, page 8, Beja, Portugal, December 2003. Springer.
29. V. Santos Costa, A. Srinivasan, R. Camacho, H. Blockeel, B. Demoen, G. Janssens, J. Struyf, H. Vandecasteele, and W. Van Laer. Query Transformations for Improving the Efficiency of ILP Systems. Journal of Machine Learning Research, 4: 465-491, August 2003.
30. V. Santos Costa, D. H. D. Warren, and R. Yang. Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism. In Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming PPOPP, pages 83-93. ACM press, April 1991. SIGPLAN Notices vol 26(7), July 1991.
31. P. Van Roy. 1983-1993: The Wonder Years of Sequential Prolog Implementation. The Journal of Logic Programming, 19/20 May/July 1994.
32. D. H. D. Warren. Prolog Engine. Technical report, Artificial Intelligence Center, SRI International, 333 Ravenswood Ave, Menlo Park CA 94025, April 1983. Unpublished draft.
33. N.-F. Zhou. Implementation of a Linear Tabling Mechanism. In E. Pontelli and V. Santos Costa, editors, Practical Aspects of Declarative Languages, number 1753 in Lecture Notes in Computer Science, pages 109-123. Springer Verlag, January 2000.
34. N.-F. Zhou, T. Takagi, and U. Kazuo. A Matching Tree Oriented Abstract Machine for Prolog. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 158-173. MIT Press, 1990.