{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T13:40:13Z","timestamp":1704202813656},"reference-count":38,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages, Systems & Structures"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0096-0551(02)00004-8","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"181-201","source":"Crossref","is-referenced-by-count":3,"title":["An optimal data structure to handle dynamic environments in non-deterministic computations"],"prefix":"10.1016","volume":"28","author":[{"given":"E.","family":"Pontelli","sequence":"first","affiliation":[]},{"given":"D.","family":"Ranjan","sequence":"additional","affiliation":[]},{"given":"A.","family":"Dal Pal\u00fa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-0551(02)00004-8_BIB1","series-title":"Constraint satisfaction in logic programming","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB2","unstructured":"Saraswat VA. Concurrent constraint programming languages. Ph.D. thesis, School of Computer Science, Carnegie Mellon, Pittsburgh, 1989."},{"key":"10.1016\/S0096-0551(02)00004-8_BIB3","series-title":"Programming expert systems in OPS5: an introduction to rule-based programming","author":"Brownston","year":"1985"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB4","doi-asserted-by":"crossref","unstructured":"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\u2013602.","DOI":"10.1145\/504083.504085"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB5","series-title":"Practical aspects of declarative languages","first-page":"288","article-title":"Construction and optimization of a parallel engine for answer set programming","volume":"vol. 1990","author":"Pontelli","year":"2001"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB6","series-title":"Proceedings of the AAAI Spring Symposium on Answer Set Programming","first-page":"72","article-title":"Computing stable models in parallel","author":"Finkel","year":"2001"},{"issue":"3","key":"10.1016\/S0096-0551(02)00004-8_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF03037223","article-title":"On the complexity of or-parallelism","volume":"17","author":"Ranjan","year":"1999","journal-title":"New Generation Computing"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB8","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/BFb0056616"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB9","series-title":"Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"123","article-title":"On the complexity of parallel implementation of logic programs","author":"Pontelli","year":"1997"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB10","series-title":"Foundations of logic programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB11","unstructured":"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\u201376."},{"issue":"2\/3","key":"10.1016\/S0096-0551(02)00004-8_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF03037208","article-title":"The aurora or-parallel prolog system","volume":"7","author":"Lusk","year":"1990","journal-title":"New Generation Computing"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB13","series-title":"Proceedings of the North American Conference on Logic Programming","first-page":"713","article-title":"Performance analysis of the aurora or-parallel prolog system","author":"Szeredi","year":"1989"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB14","series-title":"Proceedings of the International Conference on Logic Programming","first-page":"93","article-title":"ACE: and\/or-parallel copying-based execution of logic programs","author":"Gupta","year":"1994"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB15","doi-asserted-by":"crossref","unstructured":"Montelius J. Exploiting fine-grain parallelism in concurrent constraint languages. Ph.D. thesis, Uppsala University, 1997.","DOI":"10.1145\/266670.266686"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB16","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.7551\/mitpress\/4298.003.0086"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB17","unstructured":"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\u201348."},{"key":"10.1016\/S0096-0551(02)00004-8_BIB18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1996.0008","article-title":"Lower bounds for the union-find and the split-find problem on pointer machines","volume":"52","author":"LaPoutr\u00e9","year":"1996","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB19","unstructured":"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\u201357."},{"issue":"2","key":"10.1016\/S0096-0551(02)00004-8_BIB20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/202840.202846","article-title":"What is a pointer machine?","volume":"26","author":"Ben-Amram","year":"1995","journal-title":"SIGACT News"},{"issue":"18","key":"10.1016\/S0096-0551(02)00004-8_BIB21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","article-title":"A class of algorithms which require nonlinear time to maintain disjoint sets","volume":"2","author":"Tarjan","year":"1979","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"10.1016\/S0096-0551(02)00004-8_BIB22","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/0215072","article-title":"On the single-operation worst-case time complexity of the disjoint set union problem","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10.1016\/S0096-0551(02)00004-8_BIB23","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestor","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB24","doi-asserted-by":"crossref","unstructured":"Bender MA, Farach-Colton M. The LCA problem revisited. In: Proceedings of LATIN 2000: Theoretical Informatics, Latin American Symposium, Berlin: Springer, 2000. p. 88\u201394.","DOI":"10.1007\/10719839_9"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00268844","article-title":"The nearest common ancestor in a dynamic tree","volume":"25","author":"Tsakalidis","year":"1988","journal-title":"ACTA Informatica"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB26","unstructured":"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\u201344."},{"key":"10.1016\/S0096-0551(02)00004-8_BIB27","unstructured":"Pontelli E, Ranjan D. Ancestor problems on pure pointer machines. Technical Report TR-CS-004\/2001, New Mexico State University, 2001."},{"key":"10.1016\/S0096-0551(02)00004-8_BIB28","series-title":"Introduction to algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB29","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00289142","article-title":"Maintaining order in a generalized linked list","volume":"21","author":"Tsakalidis","year":"1984","journal-title":"ACTA Informatica"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB30","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/s004530010036","article-title":"The temporal precedence problem","volume":"28","author":"Ranjan","year":"2000","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0096-0551(02)00004-8_BIB31","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1145\/243439.243441","article-title":"On the notion of inheritance","volume":"28","author":"Taivalsaari","year":"1996","journal-title":"Computing Surveys"},{"issue":"6","key":"10.1016\/S0096-0551(02)00004-8_BIB32","article-title":"A survey of object-oriented programming languages","volume":"1","author":"Saunders","year":"1989","journal-title":"Journal of Object-Oriented Programming"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB33","series-title":"Smalltalk-80: the language and its implementation","author":"Goldberg","year":"1983"},{"issue":"1","key":"10.1016\/S0096-0551(02)00004-8_BIB34","doi-asserted-by":"crossref","DOI":"10.1145\/382192.383004","article-title":"Concepts and paradigms of object-oriented programming","volume":"1","author":"Wegner","year":"1990","journal-title":"OOPS Messenger"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB35","doi-asserted-by":"crossref","unstructured":"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\u201343.","DOI":"10.1145\/191080.191116"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB36","doi-asserted-by":"crossref","unstructured":"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\u201341.","DOI":"10.1145\/263698.263728"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB37","doi-asserted-by":"crossref","unstructured":"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\u201355.","DOI":"10.1145\/217838.217851"},{"key":"10.1016\/S0096-0551(02)00004-8_BIB38","doi-asserted-by":"crossref","unstructured":"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\u201323.","DOI":"10.1145\/236337.236369"}],"container-title":["Computer Languages, Systems & Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055102000048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055102000048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T13:22:42Z","timestamp":1704201762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096055102000048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0096055102000048"],"URL":"https:\/\/doi.org\/10.1016\/s0096-0551(02)00004-8","relation":{},"ISSN":["1477-8424"],"issn-type":[{"value":"1477-8424","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}