{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:34Z","timestamp":1725664834486},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625018"},{"type":"electronic","value":"9783540680499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62501-1_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:39:35Z","timestamp":1330295975000},"page":"64-79","source":"Crossref","is-referenced-by-count":1,"title":["Computing the well-founded semantics for constraint extensions of datalog\u231d"],"prefix":"10.1007","author":[{"given":"David","family":"Toman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"4_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V. Foundations of Databases. Addison-Wesley, 1995."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Beeri, C., Ramakrishnan, R. On the Power of Magic. Proc. ACM-PODS 1987, 21\u201337.","DOI":"10.1145\/28659.28689"},{"key":"4_CR3","unstructured":"Bol, R., Degerstedt, L. Tabulated Resolution for Well Founded Semantics. Proc. ILPS 1993."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Warren, D. S. Query Evaluation under the Well Founded Semantics. Proc. ACM-PODS 1993: 168\u2013179","DOI":"10.1145\/153850.153865"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. Chen","year":"1995","unstructured":"Chen, W., Swift, T., Warren, D. S. Efficient Top-Down Computation of Queries under the Well-Founded Semantics. JLP 24(3): 161\u2013199 (1995).","journal-title":"JLP"},{"key":"4_CR6","volume-title":"Manuscript","author":"J. Freire","year":"1996","unstructured":"Freire J., Swift, T., Warren, D. S. Taking I\/O Seriously: Resolution Reconsidered for Disk. Manuscript. SUNY at Stony Brook, 1996."},{"issue":"20","key":"4_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Jaffar J., Maher, M. J. Constraint Logic Programming: A Survey. J. Logic Programming 1994, 19. 20:503\u2013581.","journal-title":"J. Logic Programming"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kanellakis, P. C., Goldin, D. Constraint Programming and Database Query Languages. Proc. 2nd TACS, 1994.","DOI":"10.1007\/3-540-57887-0_92"},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P. C. Kanellakis","year":"1995","unstructured":"Kanellakis, P. C., Kuper, G. M., Revesz, P.Z. Constraint Query Languages. Journal of Computer and System Sciences 51(1):26\u201352, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(94)00153-A","volume":"146","author":"D. B. Kemp","year":"1995","unstructured":"Kemp, D. B., Srivastava, D., Stuckey, P. J. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science 146 (1995) 145\u2013184.","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Sagonas, K., Swift, T., Warren, D. S. XDB as an Efficient Deductive Database Engine. Proc. 1994 ACM SIGMOD Intl. Conf. on Management of Data, pp. 442\u2013453, 1994.","DOI":"10.1145\/191839.191927"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2307\/1968352","volume":"28","author":"C. Langford","year":"1927","unstructured":"Langford, C. Some Theorems on Deducibility. Annals of Mathematics, vol. 28, 16\u201340, 459\u2013471, 1927.","journal-title":"Annals of Mathematics"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Morishita, S. An alternating fixpoint tailored to magic programs. Proc. ACM-PODS 1993: 123\u2013134.","DOI":"10.1145\/153850.153861"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C. Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. Proc. ACM-PODS 1989: 11\u201321","DOI":"10.1145\/73721.73723"},{"key":"4_CR15","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S. CORAL: Control, relations, and logic. Proc. 18th VLDB, 238\u2013249, 1992."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S. Controlling the Search in Bottomup evaluation Proc. JICSLP'92, 273\u2013287, 1992.","DOI":"10.1007\/978-1-4615-3506-5_11"},{"issue":"no.1","key":"4_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(93)90222-F","volume":"116","author":"P. Z. Revesz","year":"1993","unstructured":"Revesz, P. Z. A Closed Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theoretical Computer Science, vol. 116, no. 1, 117\u2013149, 1993.","journal-title":"Theoretical Computer Science"},{"key":"4_CR18","volume-title":"LNCS 976","author":"P. Revesz","year":"1995","unstructured":"Revesz, P. Safe Stratified Datalog with Integer Order Programs. In Proc. First International Conference on Constraint Programming, Montanari U., Rossi F. eds., Springer-Verlag LNCS 976, Cassis, France, September 1995."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Ross, K. A. A Procedural Semantics for Well Founded Negation in Logic Programs. Proc. ACM-PODS 1989: 22\u201333.","DOI":"10.1145\/73721.73724"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Ross, K. A. Modular Stratification and Magic Sets for Datalog Programs with Negation. Proc ACM-PODS 1990, 161\u2013171.","DOI":"10.1145\/298514.298558"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Srivastava, D., Ramakrishnan, R., Revesz, P. Z. Constraint Objects. Proc. Intl. Workshop on Principles and Practice of Constraint Programming, 218\u2013228, 1994.","DOI":"10.1007\/3-540-58601-6_103"},{"key":"4_CR22","unstructured":"Stuckey, P., Sudarshan, S. Well-Founded Ordered Search. Foundations of Software Technology and Theoretical Computer Science, 1993."},{"issue":"1","key":"4_CR23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P. Stuckey","year":"1995","unstructured":"Stuckey, P. Negation in Constraint Logic Programming. Information and Computation, 118(1): 12\u201333, 1995.","journal-title":"Information and Computation"},{"key":"4_CR24","unstructured":"Sudarshan S., Srivastava, D., Ramakrishnan R., Beeri, C. Extending the Well-Founded and Valid Semantics for Aggregation. Proc. ILPS'93, 590\u2013608, 1993."},{"key":"4_CR25","unstructured":"Swift, T., Warren, D. Analysis of SLG-WAM Evaluation of Definite Programs. Proc. 1994 International Logic Programming Symposium, 1994, 219\u2013235."},{"key":"4_CR26","unstructured":"Toman, D., Chomicki, J., Rogers D. S. Datalog with Integer Periodicity Constraints. Proc. 1994 International Logic Programming Symposium, 1994, 189\u2013203."},{"key":"4_CR27","unstructured":"Toman, D. Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog. Proc. 1995 International Logic Programming Symposium, MIT Press, 1995, 98\u2013112."},{"key":"4_CR28","unstructured":"Ullman J. D. Principles of Database and Knowledge-base Systems, Vol. 1,2. Computer Science Systems, 1989."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., Ross, K. A., Schlipf, J. S. Unfounded Sets and well-founded semantics for general logic programs. Proc. ACM Symposium on Principles of Database Systems, 1988.","DOI":"10.1145\/308386.308444"},{"issue":"3","key":"4_CR30","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K. A., Schlipf, J. S. The Well-Founded Semantics for General Logic Programs. JACM 38(3): 620\u2013650 (1991).","journal-title":"JACM"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"van Gelder, A. The Alternating Fixpoint of Logic Programs with Negation. Proc. ACM-PODS 1989: 1\u201310.","DOI":"10.1145\/73721.73722"}],"container-title":["Lecture Notes in Computer Science","Constraint Databases and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62501-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:57Z","timestamp":1605647577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62501-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540625018","9783540680499"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-62501-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}