An optimal data structure to handle dynamic environments in non-deterministic computations

Computer Languages

Volumn 28, Issue 2, 2002, Pages 181-201

  Pontelli, E ^a   Ranjan, D ^a   Palú, A Dal ^a  

^a New Mexico State University   (United States)

Author keywords

Complexity analysis; Constraint programming; Logic programming; Pointer machines

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATA STRUCTURES; INTELLIGENT AGENTS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

POINTER MACHINES;

LOGIC PROGRAMMING; DATA STRUCTURES;

COMPLEXITY ANALYSIS; CONSTRAINT PROGRAMMING; OBJECT-ORIENTED SYSTEMS; POINTER MACHINES;

EID: 0037114607     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-0551(02)00004-8     Document Type: Article

References (38)

1. Van Hentenryck P. Constraint satisfaction in logic programming. 1989;MIT Press, New York.
2. Saraswat VA. Concurrent constraint programming languages. Ph.D. thesis, School of Computer Science, Carnegie Mellon, Pittsburgh, 1989.
3. Brownston L. Programming expert systems in OPS5: an introduction to rule-based programming. 1985;Addison-Wesley, Reading, MA.
4. Gupta G., Pontelli E., Carlsson M., Ali KM., Hermenegildo M. Parallel execution of Prolog: a survey. ACM Transactions on Programming Languages and Systems 2001;23(4):472-602.
5. Pontelli E., El-Kathib O. Construction and optimization of a parallel engine for answer set programming. Ramakrishnan I.V. Practical aspects of declarative languages. Lecture Notes in Computer Science. vol. 1990:2001;288-303 Springer, Heidelberg.
6. Finkel R., Marek V., Moore N., Truszczyński M. Computing stable models in parallel. Provetti A., Tran S.C. Proceedings of the AAAI Spring Symposium on Answer Set Programming. 2001;72-75 AAAI/MIT Press, Cambridge, MA.
7. Ranjan D., Pontelli E., Gupta G. On the complexity of or-parallelism. New Generation Computing. 17(3):1999;285-308.
8. Pontelli E., Ranjan D., Gupta G. The complexity of late binding in dynamic object-oriented programming languages (special issue #1). Journal of Functional and Logic Programming 1999.
9. Pontelli E., Ranjan D., Gupta G. On the complexity of parallel implementation of logic programs. Ramesh S., Sivakumar G. Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science. 1997;123-137 Springer, Heidelberg.
10. Lloyd J.W. Foundations of logic programming. 1987;Springer, Heidelberg.
11. Ali KAM., Karlsson R. The muse or-parallel prolog model and its performance. In: 1990 North American Conference on Logic Programming, Cambridge: MIT Press, 1990. p. 757-76.
12. Lusk E., Butler R., Disz T., Olson R., Stevens R., Warren D.H.D., Calderwood A., Szeredi P., Brand P., Carlsson M., Ciepielewski A., Hausman B., Haridi S. The aurora or-parallel prolog system. New Generation Computing. 7(2/3):1990;243-271.
13. Szeredi P. Performance analysis of the aurora or-parallel prolog system. Lusk E., Overbeek R. Proceedings of the North American Conference on Logic Programming. 1989;713-732 MIT Press, Cambridge, MA.
14. Gupta G., Hermenegildo M., Pontelli E., Santos Costa V. ACE: and/or-parallel copying-based execution of logic programs. van Hentenryck P. Proceedings of the International Conference on Logic Programming. 1994;93-109 MIT Press, Cambridge, MA.
15. Montelius J. Exploiting fine-grain parallelism in concurrent constraint languages. Ph.D. thesis, Uppsala University, 1997.
16. Gupta G., Santos Costa V., Pontelli E. Shared paged binding arrays: a universal data-structure for parallel logic programming In: Proceedings of the NSF/ICOT Workshop on Parallel Logic Programming and its Environments, CIS-94-04, University of Oregon, 1994.
17. Westphal H., Robert P., Chassin de Kergommeaux J., Syre J. The PEPSys model: combining backtracking, AND- and OR-parallelism. In: Proceedings of the Symposium on Logic Programming, Los Alamitos, CA: IEEE Computer Society, 1987. p. 436-48.
18. LaPoutré H. Lower bounds for the union-find and the split-find problem on pointer machines. Journal of Computer and System Sciences. 52:1996;87-99.
19. Schulte C. Parallel search made simple. In: Beldiceanu N., editor. Proceedings of Techniques for Implementing Constraint Programming Systems, Post-conference Workshop of CP 2000, number TRA9/00, University of Singapore, 2000. p. 41-57.
20. Ben-Amram A.M. What is a pointer machine? SIGACT News. 26(2):1995;88-95.
21. Tarjan R.E. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences. 2(18):1979;110-127.
22. Blum N. On the single-operation worst-case time complexity of the disjoint set union problem. SIAM Journal on Computing. 15(4):1986;1021-1024.
23. Harel D., Tarjan R.E. Fast algorithms for finding nearest common ancestor. SIAM Journal of Computing. 13(2):1984;338-355.
24. Bender MA., Farach-Colton M. The LCA problem revisited. In: Proceedings of LATIN 2000: Theoretical Informatics, Latin American Symposium, Berlin: Springer, 2000. p. 88-94.
25. Tsakalidis A.K. The nearest common ancestor in a dynamic tree. ACTA Informatica. 25:1988;37-54.
26. Cole., R., Hariharan R. Dynamic LCA queries on trees. In: Proceedings of the Symposium on Discrete Algorithms (SODA), New York: ACM/SIAM, 1999. p. 235-44.
27. Pontelli E., Ranjan D. Ancestor problems on pure pointer machines. Technical Report TR-CS-004/2001, New Mexico State University, 2001.
28. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to algorithms. 1992;MIT Press, New York.
29. Tsakalidis A. Maintaining order in a generalized linked list. ACTA Informatica. 21:1984;101-112.
30. Ranjan D., Pontelli E., Longpre L., Gupta G. The temporal precedence problem. Algorithmica. 28:2000;288-306.
31. Taivalsaari A. On the notion of inheritance. Computing Surveys. 28(3):1996;438-479.
32. Saunders J.H. A survey of object-oriented programming languages. Journal of Object-Oriented Programming. 1(6):1989.
33. Goldberg A., Robson D. Smalltalk-80: the language and its implementation. 1983;Addison-Wesley, Reading, MA.
34. Wegner P. Concepts and paradigms of object-oriented programming. OOPS Messenger. 1(1):1990.
35. Holzle U., Ungar D. A third generation SELF implementation. Conference on Object Oriented Programming Systems, Languages, and Applications. New York: ACM Press, 1994. p. 229-43.
36. Zendra O., Colnet D., Collin S. Efficient dynamic dispatch without virtual function tables. Conference on Object Oriented Programming Systems, Languages, and Applications. New York: ACM Press, 1997. p. 125-41.
37. Driesen K., Holzle U. Minimizing row displacement dispatch tables. Conference on Object Oriented Programming Systems, Languages, and Applications. New York: ACM Press, 1995. p. 141-55.
38. Driesen K., Holzle U. The direct cost of virtual function calls in C++. Conference on Object Oriented Programming Systems, Languages, and Applications. New York: ACM Press, 1996. p. 306-23.