{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:19:01Z","timestamp":1778858341995,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01530924","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:14:30Z","timestamp":1113869670000},"page":"151-186","source":"Crossref","is-referenced-by-count":23,"title":["Non-determinism in logic-based languages"],"prefix":"10.1007","volume":"3","author":[{"given":"Serge","family":"Abiteboul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"S. Abiteboul and G. Grahne, Update semantics for incomplete databases,Int. Conf. on Very Large Data Bases (1985) 1?12."},{"key":"CR2","unstructured":"S. Abiteboul and E. Simon, Fundamental properties of deterministic and non-deterministic extensions of Datalog, submitted to Theor. Comp. Sci."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, E. Simon and V. Vianu, Non-deterministic languages to express deterministic transformations,Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1990) pp. 218?229.","DOI":"10.1145\/298514.298575"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Procedural languages for database queries and updates, J. Comp. Syst. Sci. 41 (2) (1990).","DOI":"10.1016\/0022-0000(90)90036-K"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Procedural and declarative database update languages,Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1988) pp. 240?250.","DOI":"10.1145\/308386.308448"},{"key":"CR6","unstructured":"S. Abiteboul and V. Vianu, Datalog extensions for database queries and updates, INRIA Technical Report No.715 (1988), to appear in J. Comp. Syst. Sci."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Fixpoint extensions of first-order logic and Datalog-like languages,Proc. Symp. on Logic in Computer Science (1989) pp. 71?79.","DOI":"10.1109\/LICS.1989.39160"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/76359.76363","volume":"36","author":"S. Abiteboul","year":"1989","unstructured":"S. Abiteboul and V. Vianu, A transaction-based approach to relational database specification, J. ACM 36(4) (1989) 758?789.","journal-title":"J. ACM"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, The connection of static constraints with determinism and boundedness of dynamic specifications,Proc. 3rd Int. Conf. on Data and Knowledge Bases (Morgan Kaufmann, 1988) pp. 324?334.","DOI":"10.1016\/B978-1-4832-1313-2.50031-7"},{"key":"CR10","unstructured":"L. Brownston, R. Farrel, E. Kant and N. Martin,Programming Expert Systems in OPS5 (Addison-Wesley, 1985)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, Programming primitives for database languages,Proc. ACM Symp. on Principles of Programming Languages, Williamsburg (1981) pp. 50?62.","DOI":"10.1145\/567532.567537"},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel, Computable queries for relational databases, J. Comp. Syst. Sci. 21(2) (1980) 156?178.","journal-title":"J. Comp. Syst. Sci."},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A.K. Chandra","year":"1982","unstructured":"A.K. Chandra and D. Harel, Structure and complexity of relational queries, J. Comp. Syst. Sci. 25(1) (1982) 99?128.","journal-title":"J. Comp. Syst. Sci."},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/0214049","volume":"14","author":"A. Chandra","year":"1985","unstructured":"A. Chandra and M. Vardi, The implication problem for functional and inclusion dependencies is undecidable, SIAM J. Comp. 14(3) (1985) 671?677.","journal-title":"SIAM J. Comp."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus,Skolem Normal Forms Concerning the Least Fixpoint, Computation and Logic, Lecture Notes in Computer Science (Springer Verlag, 1987).","DOI":"10.1007\/3-540-18170-9_158"},{"key":"CR16","unstructured":"R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets,Complexity of Computation, ed. R. Karp, SIAM-AMS Proc. 7 (1974) pp. 43?73."},{"key":"CR17","unstructured":"L. Farinas and A. Herzig, Reasoning about database updates,Workshop on Foundations of Logic Programming and Deductive Databases, J. Minker (ed.) (1986)."},{"key":"CR18","first-page":"1","volume-title":"Trends in Theoretical Computer Science","author":"Y. Gurevich","year":"1988","unstructured":"Y. Gurevich, Logic and the challenge of computer science, in:Trends in Theoretical Computer Science, E. Borger (ed.) (Computer Science Press, New York, 1988) pp. 1?57."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic,26th Symp. on Foundations of Computer Science (1985) pp. 346?353.","DOI":"10.1109\/SFCS.1985.27"},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski and W. Lipski, Incomplete information in relational databases, J. ACM 31(4) (1984) 761?791.","journal-title":"J. ACM"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"T. Imielinski and S. Naqvi, Explicit control of logic programs through rule algebra,Proc. ACM SIGACT-SIGART-SIGMOD Symp. on Principles of Database Systems (1988) pp. 103?116.","DOI":"10.1145\/308386.308422"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"N. Immerman, Relational queries computable in polynomial time, Inf. Control 68 (1986) 86?104.","journal-title":"Inf. Control"},{"issue":"4","key":"CR23","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"N. Immerman, Languages which capture complexity classes, SIAM J. Comp. 16(4) (1987) 760?778.","journal-title":"SIAM J. Comp."},{"key":"CR24","unstructured":"P.C. Kanellakis, Elements of relational database theory, to appear as a chapter in:Handbook of Theoretical Computer Science (North-Holland)."},{"issue":"1","key":"CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"J. Kleer de","year":"1986","unstructured":"J. de Kleer, An assumption-based truth maintenance system, Art. Int. 28 (1) (1986) 127?162.","journal-title":"Art. Int."},{"key":"CR26","unstructured":"KEE Reference Manual, release 3.0, Intellicorp (1986)."},{"key":"CR27","unstructured":"P. Kolaitis, The expressive power of stratified logic programs, to appear in Inf. Comp."},{"key":"CR28","first-page":"416","volume-title":"Proc. 3rd Int. Conf. on Data and Knowledge Bases","author":"S. Naqvi","year":"1988","unstructured":"S. Naqvi and R. Krishnamurthy, Non-deterministic choice in Datalog,Proc. 3rd Int. Conf. on Data and Knowledge Bases (Morgan Kaufmann, Los Altos, 1988) pp. 416?424."},{"key":"CR29","unstructured":"A.C. Leisenring,Mathematical Logic and Hilbert's ?-symbol. (Gordon and Breach, 1969)."},{"key":"CR30","unstructured":"C. de Maindreville and E. Simon, Modelling non-deterministic queries and updates in deductive databases,Proc. Int. Conf. on Very Large Databases, Los Angeles (1988) pp. 395?407."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"S. Manchanda and D.S. Warren, A logic-based language for database updates, in:Foundations of Logic Programming and Deductive Databases, ed. J. Minker (1987).","DOI":"10.1016\/B978-0-934613-40-8.50014-2"},{"key":"CR32","volume-title":"A Logical Language for Data and Knowledge Bases","author":"S. Naqvi","year":"1989","unstructured":"S. Naqvi and S. Tsur,A Logical Language for Data and Knowledge Bases (Computer Science Press, New York, 1989)."},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"D. Sacca and C. Zaniolo, Stable models and non-determinism in logic programs with negation,Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1990) pp. 205?217.","DOI":"10.1145\/298514.298572"},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"Y. Sagiv, Optimizing datalog programs,Proc. 6th ACM Symp. on Principles of Database Systems (1987) pp. 349?362.","DOI":"10.1145\/28659.28696"},{"key":"CR35","unstructured":"E. Simon and C. de Maindreville, Deciding whether a production rule is relationally computable,Proc. 2nd Int. Conf. on Database Theory, Bruges, Belgium (1988) pp. 205?222."},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"Y. Shen, IDLOG: Extending the expressive power of deductive database languages,Proc. ACM SIGMOD Int. Conf. on Management of Data (1990) pp. 54?63.","DOI":"10.1145\/93597.93621"},{"key":"CR37","volume-title":"Principles of Database and Knowledge Base Systems","author":"J.D. Ullman","year":"1988","unstructured":"J.D. Ullman,Principles of Database and Knowledge Base Systems (Computer Science Press, New York, 1988)."},{"key":"CR38","unstructured":"M. Vardi, Relational queries computable in polynomial time,14th ACM Symp. on Theory of Computing (1982) pp. 137?146."},{"key":"CR39","unstructured":"D.S. Warren, Database updates in pure Prolog,Proc. Int. Conf. on Fifth Generation Computer Systems (1984)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530924\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530924.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530924\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:10Z","timestamp":1586217610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":39,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01530924"],"URL":"https:\/\/doi.org\/10.1007\/bf01530924","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}