The language features and architecture of B-Prolog

Theory and Practice of Logic Programming

Volumn 12, Issue 1-2, 2012, Pages 189-218

  Zhou, Neng Fa ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

logic programming system; Prolog

Indexed keywords

ABSTRACT MACHINES; ACTION RULES; ARCHITECTURAL SUPPORT; EVENT HANDLING; FINITE DOMAIN CONSTRAINTS; HASH TABLE; LANGUAGE FEATURES; LOGIC PROGRAMMING SYSTEMS; PROLOG;

ABSTRACTING; ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); FORESTRY; LOGIC PROGRAMMING;

PROLOG (PROGRAMMING LANGUAGE);

ABSTRACTS; FORESTRY;

EID: 84856234519     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068411000445     Document Type: Article

References (50)

1. Carlsson, M. 1987. Freeze, indexing, and other implementation issues in the WAM. In Proceedings of the International Conference on Logic Programming (ICLP). MIT Press, Cambridge, USA, 40-58.
2. Chen, W. and Warren, D. S. 1996. Tabled evaluation with delaying for general logic programs. Journal of the ACM 43 , 1, 20-74. (Pubitemid 126607634)
3. Debray, S. K. 1988. The SB-Prolog System, Version 3.0. SUNY Stony Brook.
4. Demoen, B. and Nguyen, P.-L. 2000. So many WAM variations, so little time. In Proceedings of the International Conference on Computational Logic (CL). LNAI, vol. 1861. 1240-1254.
5. Demoen, B. and Nguyen, P.-L. 2008a. Environment reuse in the WAM. In Proceedings of the International Conference on Logic Programming (ICLP). 698-702.
6. Demoen, B. and Nguyen, P.-L. 2008b. Two WAM implementations of action rules. In Proceedings of the International Conference on Logic Programming (ICLP). 621-635.
7. Dempster, A. P., Laird, N. M. and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the EM algorithm. Proceedings of the Royal Statistical Society, vol. 39, no. 1, 1-38.
8. Forgy, C. L. 1982. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19, 17-37.
9. Guo, H.-F. and Gupta, G. 2008. Simplifying dynamic programming via mode-directed tabling. Software Practice and Experience 38 , 1, 75-94.
10. Hickey, T. J. and Mudambi, S. 1989. Global compilation of Prolog. Journal of Logic Programming 7 , 3, 193-230. (Pubitemid 20633163)
11. Kliger, S. and Shapiro, E. Y. 1990. From decision trees to decision graphs. In Proceedings of the North American Conference on Logic Programming (NACLP). 97-116.
12. Maier, D. and Warren, D. S. 1988. Computing with Logic: Logic Programming with Prolog. The Benjamin/Cummings Publishing Company, San Francisco, California, USA.
13. Meier, M. 1991. Recursion versus iteration in Prolog. In Proceedings of the International Conference on Logic Programming (ICLP). 157-169.
14. Meier, M. 1993. Better late than never. In ICLP-Workshop on Implementation of Logic Programming Systems. 151-165.
15. Mohr, R. and Henderson, T. C. 1986. Arc and path consistency revisited. Artificial Intelligence 28, 225-233.
16. Morales, J. F., Carro, M., Puebla, G. and Hermenegildo, M. V. 2005. A generator of efficient abstract machine implementations and its application to emulator minimization. In Proceedings of the International Conference on Logic Programming (ICLP). 21-36. (Pubitemid 41491591)
17. Moura, P. 2009. From plain Prolog to Logtalk objects: Effective code encapsulation and reuse. In Proceedings of the International Conference on Logic Programming (ICLP). 23.
18. Nässén, H., Carlsson, M. and Sagonas, K. F. 2001. Instruction merging and specialization in the SICStus Prolog virtual machine. In Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP). 49-60.
19. Older, W. J. and Rummell, J. A. 1992. An incremental garbage collector for WAMbased Prolog. In Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP). 369-383.
20. Ramakrishnan, I., Rao, P., Sagonas, K., Swift, T. and Warren, D. 1998. Efficient access mechanisms for tabled logic programs. Journal of Logic Programming 38, 31-54.
21. Sagonas, K. and Swift, T. 1998. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Transactions on Programming Languages and Systems 20, 3, 586-634. (Pubitemid 128446790)
22. Santos Costa, V. 1999. Optimizing bytecode emulation for Prolog. In Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP). LNCS, vol. 1702. 261-277.
23. Santos Costa, V., Sagonas, K. F. and Lopes, R. 2007. Demand-driven indexing of Prolog clauses. In Proceedings of the International Conference on Logic Programming (ICLP). 395-409.
24. Sato, T. 2009. Generative modeling by PRISM. In Proceedings of the International Conference on Logic Programming (ICLP). 24-35.
25. Sato, T. and Kameya, Y. 2001. Parameter learning of logic programs for symbolic-statistical modeling. Journal of Artificial Intelligence Research 15, 391-454.
26. Schimpf, J. 2002. Logical loops. In Proceedings of the International Conference on Logic Programming (ICLP). 224-238.
27. Schrijvers, T., Zhou, N.-F. and Demoen, B. 2006. Translating constraint handling rules into action rules. In Proceedings of the Third Workshop on Constraint Handling Rules. 141-155.
28. Tamaki, H. and Sato, T. 1986. OLD resolution with tabulation. In Proceedings of the International Conference on Logic Programming (ICLP). 84-98.
29. Tarau, P. and Boyer, M. 1990. Elementary logic programs. In Proceedings of Programming Language Implementation and Logic Programming. 159-173.
30. van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press.
31. Van Roy, P. 1990. Can logic programming execute as fast as imperative programming? PhD thesis UCB/CSD-90-600, EECS Department, University of California, Berkeley, CA.
32. Van Roy, P. 1994. 1983-1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming 19, 20, 385-441.
33. Van Roy, P.,Demoen, B. andWillems, Y. D. 1987. Improving the execution speed of compiled Prolog with modes, clause selection, and determinism. In TAPSOFT, vol. 2. 111-125.
34. Warren, D. H. D. 1977. Implementing Prolog-compiling predicate logic programs. Research report, 39-40, Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland, UK.
35. Warren, D. H. D. 1983. An abstract Prolog instruction set. Technical note 309, SRI International, Menlo Park, California.
36. Zhou, N.-F. 1994. On the scheme of passing arguments in stack frames for Prolog. In Proceedings of the International Conference on Logic Programming (ICLP). 159-174.
37. Zhou, N.-F. 1996a. Parameter passing and control stack management in Prolog implementation revisited. ACM Transactions on Programming Languages and Systems 18, 6, 752-779. (Pubitemid 126418668)
38. Zhou, N.-F. 1996b. A novel implementation method of delay. In Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP). 97-111.
39. Zhou, N.-F. 1998. A high-level intermediate language and the algorithms for compiling finitedomain constraints. In Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP). 70-84.
40. Zhou, N.-F. 2000. Garbage collection in B-Prolog. In First Workshop on Memory Management in Logic Programming Implementations. 16-25.
41. Zhou, N.-F. 2003. CGLIB-a constraint-based graphics library. Software Practice and Experience 33, 13, 1199-1216.
42. Zhou, N.-F. 2006. Programming finite-domain constraint propagators in action rules. Theory and Practice of Logic Programming (TPLP) 6 , 5, 483-508.
43. Zhou, N.-F. 2007. A register-free abstract Prolog machine with jumbo instructions. In Proceedings of the International Conference on Logic Programming (ICLP). 455-457.
44. Zhou, N.-F. 2009. Encoding table constraints in CLP(FD) based on pair-wise AC. In Proceedings of the International Conference on Logic Programming (ICLP). 402-416.
45. Zhou, N.-F., Kameya, Y., and Sato, T. 2010.Mode-directed tabling for dynamic programming, machine learning, and constraint solving. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI). 213-218.
46. Zhou, N.-F., Sato, T. and Shen, Y.-D. 2008. Linear tabling strategies and optimizations. Theory and Practice of Logic Programming (TPLP) 8, 1, 81-109. (Pubitemid 350231350)
47. Zhou, N.-F., Shen, Y.-D. and You, J. 2011. Compiling answer set programs into eventdriven action rules. In Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 376-381.
48. Zhou, N.-F., Shen, Y.-D., Yuan, L. and You, J. 2001. Implementation of a linear tabling mechanism. Journal of Functional and Logic Programming 1, 1-15.
49. Zhou, N.-F., Takagi, T. and Ushijima, K. 1990. A matching tree oriented abstract machine for Prolog. In Proceedings of the International Conference on Logic Programming (ICLP). 159-173.
50. Zhou, N.-F., Wallace, M. and Stuckey, P. J. 2006. The dom event and its use in implementing constraint propagators. Technical report TR-2006013, CUNY Computer Science, The City University of New York, New York.