Skip to main content
SpringerLink
Log in

Rule-based languages

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The paper presents a survey of the main formal rule-based languages and semantics. Both procedural (fixpoint) and declarative (model-theoretic) semantics are defined and discussed, including inflationary and noninflationary fixpoint semantics, and the semi-positive, stratified and well-founded semantics. The relative expressive power and com-plexity of the various languages are provided. Nondeterministic rule-based languages are also discussed, and it is shown how nondeterminism can circumvent some difficulties concerning the expressive power of the deterministic languages. Finally, languages with value invention (in the spirit of object-creation in oodbs) are presented and issues of expressive power specific to such languages are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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–148.

    Google Scholar 

  2. F. Afrati and S.S. Cosmadakis, Expressiveness of restricted recursive queries, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1989) pp. 113–126.

  3. F. Afrati, S. Cosmadakis and M. Yannakakis, On Datalog vs. polynomial time, in: Proc. ACM Symp. on Principles of Database Systems (1991) pp. 13–25.

  4. S. Abiteboul and G. Grahne, Update semantics for incomplete databases, in: Proc. of Intl. Conf. on Very Large Data Bases (1985) pp. 1–12.

  5. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995).

    Google Scholar 

  6. 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–173. To appear in J. ACM.

  7. 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–41.

  8. M. Andries and J. Paredaens, A language for generic graph-transformations, in: Proc. Intl. Workshop WG 91 (Springer-Verlag, 1992) pp. 63–74.

  9. 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–229.

  10. A.V. Aho and J.D. Ullman, Universality of data retrieval languages, in: Proc. ACM Symp. on Principles of Programming Languages (1979) pp. 110–117.

  11. S. Abiteboul and V. Vianu, Procedural and declarative database update languages, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 240–250.

  12. S. Abiteboul and V. Vianu, Datalog extensions for database queries and updates, Journal of Computer and System Sciences 43 (1991) 62–124.

    Google Scholar 

  13. S. Abiteboul and V. Vianu, Generic computation and its complexity, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1991) pp. 209–219.

  14. S. Abiteboul and V. Vianu, Nondeterminism in logic-based languages, Ann. of Math. and AI 3 (1991) 151–186.

    Google Scholar 

  15. 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).

  16. K. Apt and M. van Emden, Contributions to the theory of logic programming, J. ACM 29(3) (1982) 841–862.

    Google Scholar 

  17. N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription, in: Proc. IEEE Conf. on Logic in Computer Science (1987) pp. 89–97.

  18. N. Biboit and C. Froidevaux, General logic databases and programs: Default logic semantics and stratification, J. Information and Computation 91(1) (1991) 15–54.

    Google Scholar 

  19. N. Bidoit, Bases de Données Déductives (Présentation de Datalog) (Armand Colin, Paris, 1991).

    Google Scholar 

  20. N. Bidoit, Negation in rule-based database languages: A survey, Theoretical Computer Science 78 (1991) 3–83.

    Google Scholar 

  21. 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–555. An earlier version of this work appears in: Proc. ACM SIGMOD Conf. on Management of Data (1986) pp. 16–52.

  22. 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–189.

  23. 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–236.

  24. 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).

  25. S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases (Springer-Verlag, Berlin/Heidelberg, 1990).

    Google Scholar 

  26. A.K. Chandra and D. Harel, Computable queries for relational databases, Journal of Computer and System Sciences 21(2) (1980) 156–178.

    Google Scholar 

  27. A.K. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences 25(1) (1982) 99–128.

    Google Scholar 

  28. A.K. Chandra and D. Harel, Horn clause queries and generalizations, J. Logic Programming 2(1) (1985) 1–15.

    Google Scholar 

  29. A.K. Chandra, Programming primitives for database languages, in: Proc. ACM Symp. on Principles of Programming Languages (1981) pp. 50–62.

  30. T.-P. Chang, On incremental update propagation between object-based databases, Ph.D. Thesis, University of Southern California, Los Angeles, California (1994).

    Google Scholar 

  31. 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–86.

  32. E.F. Codd, A relational model of data for large shared data banks, Comm. of the ACM 13(6) (1970) 377–387.

    Google Scholar 

  33. D. Cohen, Programming by specification and annotation, in: Proc. of AAAI (1986).

  34. J. Cohen, Constraint logic programming languages, Comm. of the ACM 33(7) (1990) 69–90.

    Google Scholar 

  35. 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–49.

  36. S. Ceri and J. Widom, Deriving production rules for constraint maintenance, in: Proc. of Intl. Conf. on Very Large Databases (1990).

  37. S. Ceri and J. Widom, Deriving production rules for incremental view maintenance, in: Proc. of Intl. Conf. on Very Large Databases (1991) pp. 577–589.

  38. 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).

  39. E. Dalhaus, Skolem normal forms concerning the least fixpoint, in: Computation Theory and Logic, ed. E. Börger, Vol. 270, Lecture Notes in Computer Science (Springer-Verlag, Berlin/New York, 1987) pp. 101–106.

    Google Scholar 

  40. 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–379.

  41. P.M. Dung, Negation as hypothesis: an abductive foundation for logic programming, in: Intl. Conf. on Logic Programming (MIT Press, 1991) pp. 3–17.

  42. 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).

  43. K. Denninghoff and V. Vianu, The power of methods with parallel semantics, in: VLDB (1991) pp. 221–232.

  44. K. Denninghoff and V. Vianu, Database method schemas and object creation, in: Proc. ACM Symp. on Principles of Database Systems (1993) pp. 265–275.

  45. J. Flum, M. Kubierschky and B. Ludascher, Total and partial well-founded Datalog coincide, manuscript (1996).

  46. C.L. Forgy, OPS5 user's manual, Technical Report CMU-CS-81-135, Carnegie Mellon University (1981).

  47. A. Van Gelder, Negation as failure using tight derivations for general logic programs, in: IEEE Symp. on Logic Programming (1986) pp. 127–139.

  48. A. Van Gelder, The alternating fixpoint of logic programs with negation, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 1–11.

  49. M. Gelfond and V. Lifschitz, The stable model semantics for logic programs, in: Intl. Conf. on Logic Programming (1988) pp. 1070–1080.

  50. F. Giannotti, D. Pedreschi, D. Saccà 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–146.

    Google Scholar 

  51. 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–230.

  52. A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (1991) 620–650.

    Google Scholar 

  53. S. Grumbach and J. Su, Finitely representable databases, in: Proc. ACM Symp. on Principles of Database Systems (1994).

  54. 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–19.

    Google Scholar 

  55. R. Hull and C.K. Yap, The Format model: A theory of database organization, J. ACM 31(3) (1984) 518–537.

    Google Scholar 

  56. T. Imielinski and W. Lipski, The relational model of data and cylindric algebras, Journal of Computer and System Sciences 28(1) (1984) 80–102.

    Google Scholar 

  57. N. Immerman, Relational queries computable in polynomial time, Inf. and Control 68 (1986) 86–104.

    Google Scholar 

  58. 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–116.

  59. J. Jaffar and J.L. Lassez, Constraint logic programming, in: Proc. ACM Symp. on Principles of Programing Languages (1987) pp. 111–119.

  60. P.C. Kanellakis, Elements of relational database theory, in: Handbook of Theoretical Computer Science, ed. J. Van Leeuwen (Elsevier, 1991) pp. 1074–1156.

  61. P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, in: Proc. 9th ACM Symp. on Principles of Database Systems (Nashville, 1990) pp. 299–313.

  62. 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–424.

    Google Scholar 

  63. P.G. Kolaitis, The expressive power of stratified logic programs, Information and Computation 90(1) (1991) 50–66.

    Google Scholar 

  64. S. Konolige, On the relation between default and autoepistemic logic, Artificial Intelligence 35(3) (1988) 343–382.

    Google Scholar 

  65. P.G. Kolaitis and C.H. Papadimitriou, Why not negation by fixpoint?, in: Proc. ACM Symp. on Principles of Database Systems (1988) pp. 231–239.

  66. G.M. Kuper, Aggregation in constraint databases, in: Proc. First Workshop on Principles and Practice of Constraint Programming (1993).

  67. 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–71.

  68. W. Leler, Constraint Programming Languages (Addison-Wesley, 1987).

  69. 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–192.

    Google Scholar 

  70. 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–311.

  71. 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–224.

  72. R.C. Moore, Semantics considerations on non-monotonic logic, Artificial Intelligence 25 (1985) 75–94.

    Google Scholar 

  73. M. Morgenstern, Active databases as a paradigm for enhanced computing environments, in: Proc. of Intl. Conf. on Very Large Data Bases (1983) pp. 34–42.

  74. Y.N. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, 1974).

  75. D. Maier and D.S. Warren, Computing with Logic: Logic Programming with Prolog (Benjamin Cummings, Menlo Park, CA, 1988).

    Google Scholar 

  76. S. Naqvi and S. Tsur, A Language for Data and Knowledge Bases (Computer Science Press, Rockville, Maryland, 1989).

    Google Scholar 

  77. C.P. Papadimitriou, A note on the expressive power of Prolog, Bulletin of the EATCS 26 (1985) 21–23.

    Google Scholar 

  78. 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–21.

  79. T. Przymusinski, Well-founded semantics coincides with three-valued stable semantics, Fundamenta Informaticae XIII (1990) 445–463.

    Google Scholar 

  80. R. Reiter, A logic for default reasoning, Artificial Intelligence 13(1) (1980) 80–132.

    Google Scholar 

  81. R. Ramakrishnan and J.D. Ullman, A survey of deductive database systems, J. Logic Programming (1995) pp. 125–149.

  82. O. Shmueli, Decidability and expressiveness aspects of logic queries, in: Proc. ACM Symp. on Principles of Database Systems (1987) pp. 237–249.

  83. 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–290.

  84. 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–326.

  85. D. Saccà 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–217.

  86. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. I (Computer Science Press, 1988).

  87. J.D. Ullman, Bottom-up beats top-down for Datalog, in: Proc. ACM Symp. on Principles of Database Systems (1989) pp. 140–149.

  88. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. II: The New Technologies (Computer Science Press, 1989).

  89. M.Y. Vardi, The complexity of relational query languages, in: Proc. ACM SIGACT Symp. on the Theory of Computing (1982) pp. 137–146.

  90. M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23(4) (1976) 733–742.

    Google Scholar 

  91. J. Widom and S. Ceri, Active Database Systems: Triggers and Rules for Advanced Database Processing (Morgan-Kaufmann, Inc, San Francisco, California, 1995).

    Google Scholar 

  92. 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–264.

  93. G. Wiederhold, Mediators in the architecture of future information systems, IEEE Computer 25(3) (March 1992) 38–49.

    Google Scholar 

Download references

Authors
  1. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vianu, V. Rule-based languages. Annals of Mathematics and Artificial Intelligence 19, 215–259 (1997). https://doi.org/10.1023/A:1018907806177

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018907806177

Keywords

Search

Navigation