{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:03Z","timestamp":1742600403060,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:01Z","timestamp":1330280041000},"page":"154-169","source":"Crossref","is-referenced-by-count":3,"title":["Safe stratified datalog with integer order programs"],"prefix":"10.1007","author":[{"given":"Peter Z.","family":"Revesz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. A\u00eft-Kaci","year":"1993","unstructured":"H. A\u00eft-Kaci, A. Podelski. Towards a Meaing of LIFE. Journal of Logic Programming, 16, 195\u2013234, 1993.","journal-title":"Journal of Logic Programming"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt, H. Blair, A. Walker. Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases in Logic Programming, Morgan-Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"M. Baudinet, M. Niette, P. Wolper. On the Representation of Infinite Temporal Data and Queries. Proc. 10th ACM PODS, 280\u2013290, 1991.","DOI":"10.1145\/113413.113439"},{"key":"10_CR4","unstructured":"A. Brodsky, J. Jaffar, M. J. Maher. Toward Practical Constraint Databases, Proc. VLDB, 1993."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra, D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21:156\u2013178, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A.K. Chandra","year":"1982","unstructured":"A.K. Chandra, D. Harel. Structure and Complexityof Relational Queries. Journal of Computer and System Sciences, 25:99\u2013128, 1982.","journal-title":"Journal of Computer and System Sciences"},{"issue":"no.2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/151634.151635","volume":"18","author":"J. Chomicki","year":"1993","unstructured":"J. Chomicki, T. Imielinski. Finite Representation of Infinite Query Answers. ACM Transactions of Database Systems, 181\u2013223, vol. 18, no. 2, 1993.","journal-title":"ACM Transactions of Database Systems"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"J. Chomicki, G. Kuper. Measuring Infinite Relations, Proc. ILPS Workshop on Constraints and Databases, 1994.","DOI":"10.1145\/212433.212455"},{"issue":"7","key":"10_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79209","volume":"33","author":"J. Cohen","year":"1990","unstructured":"J. Cohen. Constraint Logic Programming Languages. CACM, 33 (7): 69\u201390, 1990.","journal-title":"CACM"},{"issue":"4","key":"10_CR10","first-page":"412","volume":"28","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III, CACM, 28 (4): 412\u2013418, 1990.","journal-title":"CACM"},{"key":"10_CR11","unstructured":"J. Cox, K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In: Constraint Logic Programming, MIT Press, 1993."},{"key":"10_CR12","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, 1988."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"S. Grumbach, J Su. Finitely Representable Databases. Proc. 13th ACM PODS, 289\u2013300, 1994.","DOI":"10.1145\/182591.182654"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111\u2013119, 1987.","DOI":"10.1145\/41625.41635"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar, M.J. Maher. Constraint Logic Programming: A Survey. J.Logic Programming, 19 & 20, 503\u2013581, 1994.","journal-title":"J.Logic Programming"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"J. Jaffar, S. Michaylov, P.J. Stuckey, R.H. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14:3, 339\u2013395, 1992.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM PODS, 392\u2013403, 1990.","DOI":"10.1145\/298514.298590"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, D.Q. Goldin. Constraint Programming and Database Query Languages. Proc. 2nd TACS, 1994.","DOI":"10.1007\/3-540-57887-0_92"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, 299\u2013313, 1990. Final version to appear in Journal of Computer and System Sciences.","DOI":"10.1145\/298514.298582"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, J.S. Vitter. Indexing for Data Models with Constraints and Classes Proc. 12th ACM PODS, 233\u2013243, 1993.","DOI":"10.1145\/153850.153884"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"M. Koubarakis. Complexity Results for First-Order Theories of Temporal Constraints. Proc. Int. Conf. on Knowledge Representation and Reasoning, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50131-7"},{"key":"10_CR22","unstructured":"Proc. Post-ILPS Workshop on Constraints and Databases, P.Z. Revesz, D. Srivastava, P. Stuckey, S. Sudarshan (eds.). Tech. Report, Univ. of Nebraska, CSE-94-025, 1994."},{"issue":"no.1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(93)90222-F","volume":"116","author":"P. Z. Revesz","year":"1993","unstructured":"P. Z. Revesz. 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":"10_CR24","doi-asserted-by":"crossref","unstructured":"P. Z. Revesz. Datalog Queries of Set Constraint Databases. Proc. 5th International Conference on Database Theory, 423\u2013438, 1995.","DOI":"10.1007\/3-540-58907-4_32"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"D. Srivastava, R. Ramakrishnan, P.Z. Revesz. Constraint Objects. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 274\u2013284, 1994.","DOI":"10.1007\/3-540-58601-6_103"},{"key":"10_CR26","unstructured":"D. Toman, J. Chomicki, D.S. Rogers. Datalog with Integer Periodicity Constraints. Proc. International Logic Programming Symposium, 189\u2013203, 1994."},{"key":"10_CR27","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989."},{"key":"10_CR28","unstructured":"J.D. Ullman. Principles of Database and Knowledge-Base Systems, Vols 1&2, Computer Science Press, 1989."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"M. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM Symposium on the Theory of Computing, 137\u2013145, 1982.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:59:25Z","timestamp":1742597965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}