{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:04Z","timestamp":1747548604673,"version":"3.40.5"},"reference-count":93,"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:1018907806177","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"215-259","source":"Crossref","is-referenced-by-count":16,"title":["Rule-based languages"],"prefix":"10.1007","volume":"19","author":[{"given":"Victor","family":"Vianu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325417_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1988","unstructured":"K.R. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann, Los Altos, CA, 1988) pp. 89\u2013148."},{"key":"325417_CR2","doi-asserted-by":"crossref","unstructured":"F. Afrati and S.S. Cosmadakis, Expressiveness of restricted recursive queries, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1989) pp. 113\u2013126.","DOI":"10.1145\/73007.73018"},{"key":"325417_CR3","doi-asserted-by":"crossref","unstructured":"F. Afrati, S. Cosmadakis and M. Yannakakis, On Datalog vs. polynomial time, in: Proc. ACM Symp. on Principles of Database Systems (1991) pp. 13\u201325.","DOI":"10.1145\/113413.113415"},{"key":"325417_CR4","unstructured":"S. Abiteboul and G. Grahne, Update semantics for incomplete databases, in: Proc. of Intl. Conf. on Very Large Data Bases (1985) pp. 1\u201312."},{"key":"325417_CR5","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995)."},{"key":"325417_CR6","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and P.C. Kanellakis, Object identity as a query language primitive, in: Proc. ACM SIGMOD Symp. on the Management of Data (1989) pp. 159\u2013173. To appear in J. ACM.","DOI":"10.1145\/67544.66941"},{"key":"325417_CR7","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, G. Lausen, H. Uphoff and E. Waller, Methods and rules, in: Proc. ACM SIGMOD Symp. on the Management of Data (1993) pp. 32\u201341.","DOI":"10.1145\/170035.170044"},{"key":"325417_CR8","doi-asserted-by":"crossref","unstructured":"M. Andries and J. Paredaens, A language for generic graph-transformations, in: Proc. Intl. Workshop WG 91 (Springer-Verlag, 1992) pp. 63\u201374.","DOI":"10.1007\/3-540-55121-2_6"},{"key":"325417_CR9","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, E. Simon and V. Vianu, Nondeterministic languages to express deterministic transformations, in: Proc. ACM Symp. on Principles of Database Systems (1990) pp. 218\u2013229.","DOI":"10.1145\/298514.298575"},{"key":"325417_CR10","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\u2013117.","DOI":"10.1145\/567752.567763"},{"key":"325417_CR11","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Procedural and declarative database update languages, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 240\u2013250.","DOI":"10.1145\/308386.308448"},{"key":"325417_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S. Abiteboul","year":"1991","unstructured":"S. Abiteboul and V. Vianu, Datalog extensions for database queries and updates, Journal of Computer and System Sciences 43 (1991) 62\u2013124.","journal-title":"Journal of Computer and System Sciences"},{"key":"325417_CR13","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Generic computation and its complexity, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1991) pp. 209\u2013219.","DOI":"10.1145\/103418.103444"},{"key":"325417_CR14","first-page":"151","volume":"3","author":"S. Abiteboul","year":"1991","unstructured":"S. Abiteboul and V. Vianu, Nondeterminism in logic-based languages, Ann. of Math. and AI 3 (1991) 151\u2013186.","journal-title":"Ann. of Math. and AI"},{"key":"325417_CR15","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and J. Van den Bussche, Deep equality revisited, in: Proceedings 4th International Conference on Deductive and Object-Oriented Databases, Lecture Notes in Computer Science (Springer-Verlag, 1995).","DOI":"10.1007\/3-540-60608-4_42"},{"issue":"3","key":"325417_CR16","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. Apt","year":"1982","unstructured":"K. Apt and M. van Emden, Contributions to the theory of logic programming, J. ACM 29(3) (1982) 841\u2013862.","journal-title":"J. ACM"},{"key":"325417_CR17","unstructured":"N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription, in: Proc. IEEE Conf. on Logic in Computer Science (1987) pp. 89\u201397."},{"issue":"1","key":"325417_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","volume":"91","author":"N. Biboit","year":"1991","unstructured":"N. Biboit and C. Froidevaux, General logic databases and programs: Default logic semantics and stratification, J. Information and Computation 91(1) (1991) 15\u201354.","journal-title":"J. Information and Computation"},{"key":"325417_CR19","volume-title":"Bases de Donn\u00e9es D\u00e9ductives (Pr\u00e9sentation de Datalog)","author":"N. Bidoit","year":"1991","unstructured":"N. Bidoit, Bases de Donn\u00e9es D\u00e9ductives (Pr\u00e9sentation de Datalog) (Armand Colin, Paris, 1991)."},{"key":"325417_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(51)90003-5","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"N. Bidoit, Negation in rule-based database languages: A survey, Theoretical Computer Science 78 (1991) 3\u201383.","journal-title":"Theoretical Computer Science"},{"key":"325417_CR21","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, in: Readings in Database Systems, ed. M. Stonebraker (Morgan-Kaufmann, 1988) pp. 507\u2013555. An earlier version of this work appears in: Proc. ACM SIGMOD Conf. on Management of Data (1986) pp. 16\u201352.","DOI":"10.1145\/16894.16859"},{"key":"325417_CR22","doi-asserted-by":"crossref","unstructured":"A. Bondarenko, F. Toni and R. Kowalski, An assumption-based framework for non-monotonic reasoning, in: 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, eds. L.M. Pereira and A. Nerode (MIT Press, 1993) pp. 171\u2013189.","DOI":"10.7551\/mitpress\/4307.003.0016"},{"key":"325417_CR23","doi-asserted-by":"crossref","unstructured":"F. Cacace, S. Ceri, S. Crespi-Reghizzi, L. Tanca and R. Zicari, Integrating object-oriented data modeling with a rule-based programming paradigm, in: Proc. ACM SIGMOD Symp. on the Management of Data (1990) pp. 225\u2013236.","DOI":"10.1145\/93597.98732"},{"key":"325417_CR24","doi-asserted-by":"crossref","unstructured":"L. Corciulo, F. Giannotti and D. Pedreschi, Datalog with nondeterministic choice computes NDBPTIME, in: Proc. of Intl. Conf. on Deductive and Object-Oriented Databases (DOOD) (1993).","DOI":"10.1007\/3-540-57530-8_4"},{"key":"325417_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S. Ceri","year":"1990","unstructured":"S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases (Springer-Verlag, Berlin\/Heidelberg, 1990)."},{"issue":"2","key":"325417_CR26","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, Journal of Computer and System Sciences 21(2) (1980) 156\u2013178.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"325417_CR27","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, Journal of Computer and System Sciences 25(1) (1982) 99\u2013128.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"325417_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","volume":"2","author":"A.K. Chandra","year":"1985","unstructured":"A.K. Chandra and D. Harel, Horn clause queries and generalizations, J. Logic Programming 2(1) (1985) 1\u201315.","journal-title":"J. Logic Programming"},{"key":"325417_CR29","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, Programming primitives for database languages, in: Proc. ACM Symp. on Principles of Programming Languages (1981) pp. 50\u201362.","DOI":"10.1145\/567532.567537"},{"key":"325417_CR30","volume-title":"On incremental update propagation between object-based databases","author":"T.-P. Chang","year":"1994","unstructured":"T.-P. Chang, On incremental update propagation between object-based databases, Ph.D. Thesis, University of Southern California, Los Angeles, California (1994)."},{"key":"325417_CR31","doi-asserted-by":"crossref","unstructured":"I.-M.A. Chen, R. Hull and D. McLeod, Local ambiguity and derived data update, in: Fourth Intl. Workshop on Research Issues in Data Engineering: Active Database Systems (1994) pp. 77\u201386.","DOI":"10.1109\/RIDE.1994.282850"},{"issue":"6","key":"325417_CR32","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"E.F. Codd, A relational model of data for large shared data banks, Comm. of the ACM 13(6) (1970) 377\u2013387.","journal-title":"Comm. of the ACM"},{"key":"325417_CR33","unstructured":"D. Cohen, Programming by specification and annotation, in: Proc. of AAAI (1986)."},{"issue":"7","key":"325417_CR34","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, Comm. of the ACM 33(7) (1990) 69\u201390.","journal-title":"Comm. of the ACM"},{"key":"325417_CR35","unstructured":"M.A. Casanova, L. Tucherman and A.L. Furtado, Enforcing inclusion dependencies and referential integrity, in: Proc. of Intl. Conf. on Very Large Databases (1988) pp. 38\u201349."},{"key":"325417_CR36","unstructured":"S. Ceri and J. Widom, Deriving production rules for constraint maintenance, in: Proc. of Intl. Conf. on Very Large Databases (1990)."},{"key":"325417_CR37","unstructured":"S. Ceri and J. Widom, Deriving production rules for incremental view maintenance, in: Proc. of Intl. Conf. on Very Large Databases (1991) pp. 577\u2013589."},{"key":"325417_CR38","unstructured":"S. Ceri and J. Widom, Managing semantic heterogeneity with production rules and persistent queues, in: Proc. of Intl. Conf. on Very Large Data Bases (1993)."},{"key":"325417_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-18170-9_158","volume-title":"Computation Theory and Logic","author":"E. Dalhaus","year":"1987","unstructured":"E. Dalhaus, Skolem normal forms concerning the least fixpoint, in: Computation Theory and Logic, ed. E. B\u00f6rger, Vol. 270, Lecture Notes in Computer Science (Springer-Verlag, Berlin\/New York, 1987) pp. 101\u2013106."},{"key":"325417_CR40","doi-asserted-by":"crossref","unstructured":"J. Van den Bussche, D. Van Gucht, M. Andries and M. Gyssens, On the completeness of objectcreating query languages, in: IEEE Conf. on Foundations of Computer Science (1992) pp. 372\u2013379.","DOI":"10.1109\/SFCS.1992.267753"},{"key":"325417_CR41","unstructured":"P.M. Dung, Negation as hypothesis: an abductive foundation for logic programming, in: Intl. Conf. on Logic Programming (MIT Press, 1991) pp. 3\u201317."},{"key":"325417_CR42","doi-asserted-by":"crossref","unstructured":"P.M. Dung, The acceptability of arguments and its fundamental role in logic programming, nonmonotonic reasoning and n-person games, Artificial Intelligence 77(2) (1995).","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"325417_CR43","unstructured":"K. Denninghoff and V. Vianu, The power of methods with parallel semantics, in: VLDB (1991) pp. 221\u2013232."},{"key":"325417_CR44","doi-asserted-by":"crossref","unstructured":"K. Denninghoff and V. Vianu, Database method schemas and object creation, in: Proc. ACM Symp. on Principles of Database Systems (1993) pp. 265\u2013275.","DOI":"10.1145\/153850.153911"},{"key":"325417_CR45","doi-asserted-by":"crossref","unstructured":"J. Flum, M. Kubierschky and B. Ludascher, Total and partial well-founded Datalog coincide, manuscript (1996).","DOI":"10.1007\/3-540-62222-5_40"},{"key":"325417_CR46","doi-asserted-by":"crossref","unstructured":"C.L. Forgy, OPS5 user's manual, Technical Report CMU-CS-81-135, Carnegie Mellon University (1981).","DOI":"10.21236\/ADA106558"},{"key":"325417_CR47","unstructured":"A. Van Gelder, Negation as failure using tight derivations for general logic programs, in: IEEE Symp. on Logic Programming (1986) pp. 127\u2013139."},{"key":"325417_CR48","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternating fixpoint of logic programs with negation, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 1\u201311.","DOI":"10.1145\/73721.73722"},{"key":"325417_CR49","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programs, in: Intl. Conf. on Logic Programming (1988) pp. 1070\u20131080."},{"key":"325417_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-55015-1_7","volume-title":"Proc. of Intl. Conf. on Deductive and Object-Oriented Databases (DOOD)","author":"F. Giannotti","year":"1991","unstructured":"F. Giannotti, D. Pedreschi, D. Sacc\u00e0 and C. Zaniolo, Nondeterminism in deductive databases, in: Proc. of Intl. Conf. on Deductive and Object-Oriented Databases (DOOD), Lecture Notes in Computer Science 566 (Springer-Verlag, Los Altos, CA, 1991) pp. 129\u2013146."},{"key":"325417_CR51","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 221\u2013230.","DOI":"10.1145\/308386.308444"},{"key":"325417_CR52","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Van Gelder","year":"1991","unstructured":"A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620\u2013650.","journal-title":"J. ACM"},{"key":"325417_CR53","doi-asserted-by":"crossref","unstructured":"S. Grumbach and J. Su, Finitely representable databases, in: Proc. ACM Symp. on Principles of Database Systems (1994).","DOI":"10.1145\/182591.182654"},{"issue":"3","key":"325417_CR54","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/71031.71033","volume":"18","author":"E.H. Hanson","year":"1989","unstructured":"E.H. Hanson, An initial report on the design of ariel: a dbms with an integrated production rule system, Sigmod Record 18(3) (1989) 12\u201319.","journal-title":"Sigmod Record"},{"issue":"3","key":"325417_CR55","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/828.832","volume":"31","author":"R. Hull","year":"1984","unstructured":"R. Hull and C.K. Yap, The Format model: A theory of database organization, J. ACM 31(3) (1984) 518\u2013537.","journal-title":"J. ACM"},{"issue":"1","key":"325417_CR56","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0022-0000(84)90077-1","volume":"28","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski and W. Lipski, The relational model of data and cylindric algebras, Journal of Computer and System Sciences 28(1) (1984) 80\u2013102.","journal-title":"Journal of Computer and System Sciences"},{"key":"325417_CR57","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. and Control 68 (1986) 86\u2013104.","journal-title":"Inf. and Control"},{"key":"325417_CR58","doi-asserted-by":"crossref","unstructured":"T. Imielinski and S. Naqvi, Explicit control of logic programs through rule algebra, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 103\u2013116.","DOI":"10.1145\/308386.308422"},{"key":"325417_CR59","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.L. Lassez, Constraint logic programming, in: Proc. ACM Symp. on Principles of Programing Languages (1987) pp. 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"325417_CR60","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, Elements of relational database theory, in: Handbook of Theoretical Computer Science, ed. J. Van Leeuwen (Elsevier, 1991) pp. 1074\u20131156.","DOI":"10.1016\/B978-0-444-88074-1.50022-6"},{"key":"325417_CR61","doi-asserted-by":"crossref","unstructured":"P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, in: Proc. 9th ACM Symp. on Principles of Database Systems (Nashville, 1990) pp. 299\u2013313.","DOI":"10.1145\/298514.298582"},{"key":"325417_CR62","first-page":"416","volume-title":"5th Intl. Conf. on Data and Knowledge Bases","author":"R. Krishnamurthy","year":"1988","unstructured":"R. Krishnamurthy and S.A. Naqvi, Nondeterministic choice in Datalog, in: 5th Intl. Conf. on Data and Knowledge Bases (Morgan-Kaufmann, Los Altos, CA, 1988) pp. 416\u2013424."},{"issue":"1","key":"325417_CR63","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","volume":"90","author":"P.G. Kolaitis","year":"1991","unstructured":"P.G. Kolaitis, The expressive power of stratified logic programs, Information and Computation 90(1) (1991) 50\u201366.","journal-title":"Information and Computation"},{"issue":"3","key":"325417_CR64","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"S. Konolige","year":"1988","unstructured":"S. Konolige, On the relation between default and autoepistemic logic, Artificial Intelligence 35(3) (1988) 343\u2013382.","journal-title":"Artificial Intelligence"},{"key":"325417_CR65","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis and C.H. Papadimitriou, Why not negation by fixpoint?, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 231\u2013239.","DOI":"10.1145\/308386.308446"},{"key":"325417_CR66","unstructured":"G.M. Kuper, Aggregation in constraint databases, in: Proc. First Workshop on Principles and Practice of Constraint Programming (1993)."},{"key":"325417_CR67","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis and M.Y. Vardi, On the expressive power of Datalog: tools and a case study, in: Proc. ACM Symp. on Principles of Database Systems (1990) pp. 61\u201371.","DOI":"10.1145\/298514.298542"},{"key":"325417_CR68","unstructured":"W. Leler, Constraint Programming Languages (Addison-Wesley, 1987)."},{"key":"325417_CR69","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/B978-0-934613-40-8.50008-7","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"V. Lifschitz","year":"1988","unstructured":"V. Lifschitz, On the declarative semantics of logic programs with negation, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann, Los Altos, CA, 1988) pp. 177\u2013192."},{"key":"325417_CR70","doi-asserted-by":"crossref","unstructured":"V.S. Lakshmanan and A.O. Mendelzon, Inductive pebble games and the inductive power of Datalog, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 301\u2013311.","DOI":"10.1145\/73721.73751"},{"key":"325417_CR71","doi-asserted-by":"crossref","unstructured":"D. McCarthy and U. Dayal, The architecture of an active database management system, in: Proc. ACM SIGMOD Symp. on the Management of Data (1989) pp. 215\u2013224.","DOI":"10.1145\/67544.66946"},{"key":"325417_CR72","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R.C. Moore","year":"1985","unstructured":"R.C. Moore, Semantics considerations on non-monotonic logic, Artificial Intelligence 25 (1985) 75\u201394.","journal-title":"Artificial Intelligence"},{"key":"325417_CR73","unstructured":"M. Morgenstern, Active databases as a paradigm for enhanced computing environments, in: Proc. of Intl. Conf. on Very Large Data Bases (1983) pp. 34\u201342."},{"key":"325417_CR74","unstructured":"Y.N. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, 1974)."},{"key":"325417_CR75","volume-title":"Computing with Logic: Logic Programming with Prolog","author":"D. Maier","year":"1988","unstructured":"D. Maier and D.S. Warren, Computing with Logic: Logic Programming with Prolog (Benjamin Cummings, Menlo Park, CA, 1988)."},{"key":"325417_CR76","volume-title":"A Language for Data and Knowledge Bases","author":"S. Naqvi","year":"1989","unstructured":"S. Naqvi and S. Tsur, A Language for Data and Knowledge Bases (Computer Science Press, Rockville, Maryland, 1989)."},{"key":"325417_CR77","first-page":"21","volume":"26","author":"C.P. Papadimitriou","year":"1985","unstructured":"C.P. Papadimitriou, A note on the expressive power of Prolog, Bulletin of the EATCS 26 (1985) 21\u201323.","journal-title":"Bulletin of the EATCS"},{"key":"325417_CR78","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, Every logic program has a natural stratification and an iterated least fixpoint model, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 11\u201321.","DOI":"10.1145\/73721.73723"},{"key":"325417_CR79","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"XIII","author":"T. Przymusinski","year":"1990","unstructured":"T. Przymusinski, Well-founded semantics coincides with three-valued stable semantics, Fundamenta Informaticae XIII (1990) 445\u2013463.","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"325417_CR80","first-page":"80","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence 13(1) (1980) 80\u2013132.","journal-title":"Artificial Intelligence"},{"key":"325417_CR81","doi-asserted-by":"crossref","unstructured":"R. Ramakrishnan and J.D. Ullman, A survey of deductive database systems, J. Logic Programming (1995) pp. 125\u2013149.","DOI":"10.1016\/0743-1066(94)00039-9"},{"key":"325417_CR82","doi-asserted-by":"crossref","unstructured":"O. Shmueli, Decidability and expressiveness aspects of logic queries, in: Proc. ACM Symp. on Principles of Database Systems (1987) pp. 237\u2013249.","DOI":"10.1145\/28659.28685"},{"key":"325417_CR83","doi-asserted-by":"crossref","unstructured":"M. Stonebraker, A. Jhingran, J. Goh and S. Potamianos, On rules, procedures, caching and views in database systems, in: Proc. ACM SIGMOD Symp. on the Management of Data (1990) pp. 281\u2013290.","DOI":"10.1145\/93597.98737"},{"key":"325417_CR84","unstructured":"E. Simon, J. Kiernan and C. de Maindreville, Implementing high level active rules on top of a relational dbms, in: Proc. of Intl. Conf. on Very Large Databases (1992) pp. 315\u2013326."},{"key":"325417_CR85","doi-asserted-by":"crossref","unstructured":"D. Sacc\u00e0 and C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proc. ACM Symp. on Principles of Database Systems (1990) pp. 205\u2013217.","DOI":"10.1145\/298514.298572"},{"key":"325417_CR86","unstructured":"J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. I (Computer Science Press, 1988)."},{"key":"325417_CR87","doi-asserted-by":"crossref","unstructured":"J.D. Ullman, Bottom-up beats top-down for Datalog, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 140\u2013149.","DOI":"10.1145\/73721.73736"},{"key":"325417_CR88","unstructured":"J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. II: The New Technologies (Computer Science Press, 1989)."},{"key":"325417_CR89","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, The complexity of relational query languages, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1982) pp. 137\u2013146.","DOI":"10.1145\/800070.802186"},{"issue":"4","key":"325417_CR90","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. van Emden","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23(4) (1976) 733\u2013742.","journal-title":"J. ACM"},{"key":"325417_CR91","volume-title":"Active Database Systems: Triggers and Rules for Advanced Database Processing","author":"J. Widom","year":"1995","unstructured":"J. Widom and S. Ceri, Active Database Systems: Triggers and Rules for Advanced Database Processing (Morgan-Kaufmann, Inc, San Francisco, California, 1995)."},{"key":"325417_CR92","doi-asserted-by":"crossref","unstructured":"J. Widom and S.J. Finkelstein, Set-oriented production rules in relational database systems, in: Proc. ACM SIGMOD Symp. on the Management of Data (1990) pp. 259\u2013264.","DOI":"10.1145\/93597.98735"},{"issue":"3","key":"325417_CR93","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.121508","volume":"25","author":"G. Wiederhold","year":"1992","unstructured":"G. Wiederhold, Mediators in the architecture of future information systems, IEEE Computer 25(3) (March 1992) 38\u201349.","journal-title":"IEEE Computer"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018907806177.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018907806177\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018907806177.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:35:24Z","timestamp":1747546524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018907806177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":93,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["325417"],"URL":"https:\/\/doi.org\/10.1023\/a:1018907806177","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}