{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:06Z","timestamp":1747548606730,"version":"3.40.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1018951521198","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"127-146","source":"Crossref","is-referenced-by-count":14,"title":["Deterministic FOIES are strictly weaker"],"prefix":"10.1007","volume":"19","author":[{"given":"Guozhu","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325414_CR1","unstructured":"S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1995)."},{"key":"325414_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt and J.-M. Pugin, Maintenance of stratified databases viewed as a belief revision system, in: Proc. ACM Symp. on Principles of Database Systems (1987) pp. 136\u2013145.","DOI":"10.1145\/28659.28674"},{"key":"325414_CR3","doi-asserted-by":"crossref","unstructured":"A.V. Aho and J.D. Ullman, Universality of data retrieval languages, in: Proc. ACM Symp. on Principles of Programming Languages (1979) pp. 110\u2013120.","DOI":"10.1145\/567752.567763"},{"key":"325414_CR4","first-page":"156","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel, Computable queries for relational data bases, J.C.S.S. 21 (1980) 156\u2013178.","journal-title":"J.C.S.S."},{"key":"325414_CR5","unstructured":"AAAS Workshop on Advances in Data management for the Scientist and Engineer, in: Proceedings of the NSF Scientific Database Projects, Boston, MA (February 1993)."},{"key":"325414_CR6","unstructured":"S. Ceri and J. Widom, Deriving production rules for incremental view maintenance, in: Proc. Int. Conf. Very Large Databases (1991)."},{"key":"325414_CR7","unstructured":"G. Dong and R. Kotagiri, Incrementally evaluating constrained transitive closure by conjunctive queries, Technical Report 94\/11, Computer Science, University of Melbourne (1994). Revised July 1995."},{"key":"325414_CR8","doi-asserted-by":"crossref","unstructured":"G. Dong, L. Libkin and L. Wong, On impossibility of decremental recomputation of recursive queries in relational calculus and SQL, in: Proc. Int. Workshop on Database Programming Languages (1995).","DOI":"10.14236\/ewic\/DBPL1995.10"},{"key":"325414_CR9","unstructured":"G. Dong and C. Pang, First-order maintenance of transitive closure over acyclic node and edge updates, Technical Report 95\/5, Computer Science, University of Melbourne (1995)."},{"key":"325414_CR10","doi-asserted-by":"crossref","unstructured":"G. Dong and J. Su, First-order incremental evaluation of DATALOG queries (extended abstract), in: Proc. 4th Int. Workshop on Database Programming Languages (1993).","DOI":"10.1007\/978-1-4471-3564-7_17"},{"key":"325414_CR11","doi-asserted-by":"crossref","unstructured":"G. Dong and J. Su, Increment boundedness and nonrecursive incremental evaluation of DATALOG queries (extended abstract), in: Database Theory \u2014 ICDT '95, eds. G. Gottlob and M.Y. Vardi (Springer-Verlag, 1995) pp. 397\u2013410.","DOI":"10.1007\/3-540-58907-4_30"},{"key":"325414_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G. Dong","year":"1995","unstructured":"G. Dong and J. Su, Incremental and decremental evaluation of transitive closure by first-order queries, Information & Computation 120 (1995) 101\u2013106.","journal-title":"Information & Computation"},{"key":"325414_CR13","doi-asserted-by":"crossref","unstructured":"G. Dong and J. Su, Space-bounded FOIES, invited to the J.C.S.S. Special Issue on PODS'95; an extended abstract appears in Proc. ACM Symp. on Principles of Database Systems (1995) pp. 139\u2013150.","DOI":"10.1145\/212433.220204"},{"key":"325414_CR14","first-page":"187","volume":"14","author":"G. Dong","year":"1995","unstructured":"G. Dong, J. Su and R. Topor, Nonrecursive incremental evaluation of DATALOG queries, Ann. of Math. and AI 14 (1995) 187\u2013223.","journal-title":"Ann. of Math. and AI"},{"key":"325414_CR15","doi-asserted-by":"crossref","unstructured":"G. Dong and R. Topor, Incremental evaluation of DATALOG queries, in: Proc. Int'l Conference on Database Theory (1992) pp. 282\u2013296.","DOI":"10.1007\/3-540-56039-4_48"},{"key":"325414_CR16","unstructured":"G. Dong and L. Wong, Some relationships between FOIES and \u221111 arity hierarchies, TR 96\/27, Computer Science, University of Melbourne (July 1996)."},{"key":"325414_CR17","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961).","DOI":"10.4064\/fm-49-2-129-141"},{"issue":"1","key":"325414_CR18","first-page":"35","volume":"I","author":"R. Fra\u00efss\u00e9","year":"1954","unstructured":"R. Fra\u00efss\u00e9, Sur les classifications des syst\u00e8mes de relations, Publ. Sci. Univ. Alger. I(1) (1954) 35\u2013182.","journal-title":"Publ. Sci. Univ. Alger."},{"key":"325414_CR19","doi-asserted-by":"crossref","unstructured":"T. Griffin and L. Libkin, Incremental maintenance of views with duplicates, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1995).","DOI":"10.1145\/223784.223849"},{"key":"325414_CR20","doi-asserted-by":"crossref","unstructured":"A. Gupta, I.S. Mumick and V.S. Subrahmanian, Maintaining views incrementally, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1993) pp. 157\u2013166.","DOI":"10.1145\/170036.170066"},{"key":"325414_CR21","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis, A tutorial on combinatorial games in database theory, in: Proc. ACM Symp. on Principles of Database Systems (1995).","DOI":"10.1145\/212433.212461"},{"key":"325414_CR22","doi-asserted-by":"crossref","unstructured":"V. K\u00fcchenhoff, On the efficient computation of the difference between consecutive database states, in: Proc. 2nd Int. Conf. on Deductive Object-Oriented Databases, eds. C. Delobel, M. Kifer and Y. Masunaga (Springer-Verlag, 1991) pp. 478\u2013502.","DOI":"10.1007\/3-540-55015-1_26"},{"key":"325414_CR23","doi-asserted-by":"crossref","unstructured":"S. Patnaik and N. Immerman, Dyn-FO: a parallel dynamic complexity class, in: Proc. ACM Symp. on Principles of Database Systems (1994) pp. 210\u2013221.","DOI":"10.1145\/182591.182614"},{"key":"325414_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/69.91063","volume":"3","author":"X. Qian","year":"1991","unstructured":"X. Qian and G. Wiederhold, Incremental recomputation of active relational expressions, IEEE Trans. on Knowledge and Data Eng. 3 (1991) 337\u2013341.","journal-title":"IEEE Trans. on Knowledge and Data Eng."},{"key":"325414_CR25","unstructured":"R. Ramakrishnan, K.A. Ross, D. Srivastava and S. Sudarshan, Efficient incremental evaluation of queries with aggregation, in: Int. Logic Programming Symp. (1994)."},{"key":"325414_CR26","doi-asserted-by":"crossref","unstructured":"O. Wolfson, H.M. Dewan, S.J. Stolfo and Y. Yemini, Incremental evaluation of rules and its relationship to parallelism, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1991) pp. 78\u201387.","DOI":"10.1145\/115790.115799"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018951521198.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018951521198\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018951521198.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:37:58Z","timestamp":1747546678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018951521198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["325414"],"URL":"https:\/\/doi.org\/10.1023\/a:1018951521198","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}