Skip to main content
SpringerLink
Log in
Book cover

Reasoning Web International Summer School

Reasoning Web 2007: Reasoning Web pp 1–153Cite as

Foundations of Rule-Based Query Answering

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4636))

Abstract

This survey article introduces into the essential concepts and methods underlying rule-based query languages. It covers four complementary areas: declarative semantics based on adaptations of mathematical logic, operational semantics, complexity and expressive power, and optimisation of query evaluation.

The treatment of these areas is foundation-oriented, the foundations having resulted from over four decades of research in the logic programming and database communities on combinations of query languages and rules. These results have later formed the basis for conceiving, improving, and implementing several Web and Semantic Web technologies, in particular query languages such as XQuery or SPARQL for querying relational, XML, and RDF data, and rule languages like the “Rule Interchange Framework (RIF)” currently being developed in a working group of the W3C.

Coverage of the article is deliberately limited to declarative languages in a classical setting: issues such as query answering in F-Logic or in description logics, or the relationship of query answering to reactive rules and events, are not addressed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Beeri, C.: The Power of Languages for the Manipulation of Complex Values. VLDB Journal 4(4), 727–794 (1995)

    Article  Google Scholar 

  2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley Publishing Co., Reading (1995)

    MATH  Google Scholar 

  3. Abiteboul, S., Kanellakis, P.C.: Object Identity as a Query Language Primitive. Journal of the Association for Computing Machinery 45(5), 798–842 (1998)

    MATH  MathSciNet  Google Scholar 

  4. Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wienerm, J.L.: The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries 1(1), 68–88 (1997)

    Article  Google Scholar 

  5. Abiteboul, S., Vianu, V.: Datalog Extensions for Database Queries and Updates. Journal of Computer and System Sciences 43, 62–124 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Abiteboul, S., Vianu, V.: Regular Path Queries with Constraints. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 122–133. ACM Press, New York (1997)

    Chapter  Google Scholar 

  7. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of Tree Pattern Queries. In: SIGMOD. Proc. ACM SIGMOD Symposium on the Management of Data, pp. 497–508. ACM Press, New York (2001)

    Chapter  Google Scholar 

  8. Andréka, Németi: The Generalized Completeness of Horn Predicate Logic as a Programming Language. Acta Cybernetica 4, 3–10 (1978)

    MATH  MathSciNet  Google Scholar 

  9. Apt, K., Blair, H., Walker, A.: Towards a Theory of Declarative Knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  10. Apt, K., Doets, K.: A New Definition of SLDNF-Resolution. Journal of Logic Programming 18, 177–190 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Astrahan, M.M., Blasgen, M.W., Chamberlin, D.D., Eswaran, K.P., Gray, J.N., Griffiths, P.P., King, W.F., Lorie, R.A., McJones, P.R., Mehl, J.W., Putzolu, G.R., Traiger, I.L., Wade, B.W., Watson, V.: System R: Relational Approach to Database Management. ACM Transactions on Database Systems 1(2), 97–137 (1976)

    Article  Google Scholar 

  12. Atkinson, M., DeWitt, D., Maier, D., Bancilhon, F., Dittrich, K., Zdonik, S.: The Object-oriented Database System Manifesto. In: Bancilhon, F., Delobel, C., Kanellakis, P. (eds.) Building an Object-oriented Database System: The Story of O2, pp. 1–20. Morgan Kaufmann Publishers Inc., San Francisco (1992)

    Google Scholar 

  13. Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp. 447–533. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  14. Bailey, J., Bry, F., Furche, T., Schaffert, S.: Web and Semantic Web Query Languages: A Survey. In: Eisinger, N., Małuszyński, J. (eds.) Reasoning Web. LNCS, vol. 3564, Springer, Heidelberg (2005)

    Google Scholar 

  15. Balbin, I., Meenakshi, K., Ramamohanarao, K.: A Query Independent Method for Magic Set Computation on Stratified Databases. In: Proc. International Conference on Fifth Generation Computer Systems, pp. 711–718 (1988)

    Google Scholar 

  16. Balbin, I., Port, G., Ramamohanarao, K., Meenakshi, K.: Efficient Bottom-Up Computation of Queries of Stratified Databases. Journal of Logic Programming 11, 295–344 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Balcázar, J., Lozano, A., Torán, J.: The Complexity of Algorithmic Problems on Succinct Instances. In: Baeta-Yates, R., Manber, U. (eds.) Computer Science, pp. 351–377. Plenum Press, New York, USA (1992)

    Google Scholar 

  18. Beeri, C., Ramakrishnan, R.: On the Power of Magic. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 269–283. ACM Press, New York (1987)

    Google Scholar 

  19. Behrend, A.: Soft Stratification for Magic set based Query Evaluation in Deductive Databases. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 102–110. ACM Press, New York (2003)

    Google Scholar 

  20. Benanav, D., Kapur, D., Narendran, P.: Complexity of Matching Problems. In: Jouannaud, J.-P. (ed.) Rewriting Techniques and Applications. LNCS, vol. 202, pp. 417–429. Springer, Heidelberg (1985)

    Google Scholar 

  21. Bernstein, P.A., Chiu, D.-M.W.: Using Semi-Joins to Solve Relational Queries. Journal of the Association for Computing Machinery 28(1), 25–40 (1981)

    MATH  MathSciNet  Google Scholar 

  22. Bidoit, N., Froidevaux, C.: Negation by Default and Unstratifiable Programs. Theoretical Computer Science 78, 85–112 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  23. Bönström, V., Hinze, A., Schweppe, H.: Storing RDF as a Graph. In: Proc. Latin American Web Congress, pp. 27–36 (2003)

    Google Scholar 

  24. Brass, S., Dix, J.: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation. In: Sterling, L. (ed.) International Conference on Logic Programming, pp. 199–213. MIT Press, Cambridge (1995)

    Google Scholar 

  25. Breazu-Tannen, V., Buneman, P., Wong, L.: Naturally Embedded Query Languages. In: Hull, R., Biskup, J. (eds.) ICDT 1992. LNCS, vol. 646, pp. 140–154. Springer, Heidelberg (1992)

    Google Scholar 

  26. Bry, F.: Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. In: SIGMOD. Proc. ACM SIGMOD Symposium on the Management of Data, pp. 193–204. ACM Press, New York (1989)

    Google Scholar 

  27. Bry, F.: Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled. Data and Knowledge Engineering 5(4), 289–312 (1990)

    Article  Google Scholar 

  28. Bry, F., Pătrânjan, P.-L., Schaffert, S.: Xcerpt and XChange: Logic Programming Languages for Querying and Evolution on the Web. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, Springer, Heidelberg (2004)

    Google Scholar 

  29. Bry, F., Schaffert, S.: Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  30. Bry, F., Schaffert, S., Schröder, A.: A Contribution to the Semantics of Xcerpt, a Web Query and Transformation Language. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds.) Applications of Declarative Programming and Knowledge Management. LNCS (LNAI), vol. 3392, pp. 258–268. Springer, Heidelberg (2005)

    Google Scholar 

  31. Buneman, P., Fan, W., Weinstein, S.: Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model. In: DBLP. Proc. International Workshop on Database Programming Languages, pp. 208–223. Springer, Heidelberg (2000)

    Google Scholar 

  32. Buneman, P., Naqvi, S., Tannen, V., Wong, L.: Principles of Programming with Complex Objects and Collection Types. Theoretical Computer Science 149(1), 3–48 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  33. Cavedon, L., Lloyd, J.: A Completeness Theorem for SLDNF-Resolution. Journal of Logic Programming 7, 177–191 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  34. Ceri, S., Gottlob, G.: Translating SQL into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries. IEEE Transactions on Software Engineering 11(4), 324–345 (1985)

    Article  Google Scholar 

  35. Chan, C.-Y., Fan, W., Zeng, Y.: Taming XPath Queries by Minimizing Wildcard Steps. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) Databases, Information Systems, and Peer-to-Peer Computing. LNCS, vol. 2944, Springer, Heidelberg (2004)

    Google Scholar 

  36. Chandra, A., Harel, D.: Structure and Complexity of Relational Queries. Journal of Computer and System Sciences 25, 99–128 (1982)

    Article  MATH  Google Scholar 

  37. Chandra, A.K., Merlin, P.M.: Optimal Implementation of Conjunctive Queries in Relational Data Bases. In: STOC. ACM Symposium on Theory of Computing, pp. 77–90. ACM Press, New York (1977)

    Google Scholar 

  38. Chaudhuri, S.: Optimization of Real Conjunctive Queries. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 59–70. ACM Press, New York (1993)

    Google Scholar 

  39. Che, D., Aberer, K., Özsu, T.: Query Optimization in XML Structured-document Databases. The VLDB Journal 15(3), 263–289 (2006)

    Article  Google Scholar 

  40. Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. Journal of the Association for Computing Machinery 43(1), 20–74 (1996)

    MATH  MathSciNet  Google Scholar 

  41. Chen, Y.: A Bottom-up Query Evaluation Method for Stratified Databases. In: ICDE. Proc. International Conference on Data Engineering, pp. 568–575. IEEE Computer Society Press, Los Alamitos (1993)

    Google Scholar 

  42. Clark, K.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Base, pp. 293–322. Plenum Press, New York, USA (1978)

    Google Scholar 

  43. Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. Communications of the ACM 13(6), 377–387 (1970)

    Article  MATH  Google Scholar 

  44. Codd, E.F.: Relational Completeness of Data Base Sublanguages. Database Systems, pp. 65–98 (1972)

    Google Scholar 

  45. Codd, E.F.: Extending the Database Relational Model to Capture more Meaning. ACM Transactions on Database Systems 4(4), 397–434 (1979)

    Article  Google Scholar 

  46. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. In: Proc. IEEE Conference on Computational Complexity, pp. 82–101 (1997)

    Google Scholar 

  47. Dantsin, E., Voronkov, A.: Complexity of Query Answering in Logic Databases with Complex Values. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 56–66. Springer, Heidelberg (1997)

    Google Scholar 

  48. Dantsin, E., Voronkov, A.: Expressive Power and Data Complexity of Nonrecursive Query Languages for Lists and Trees. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 157–165. ACM Press, New York (2000)

    Chapter  Google Scholar 

  49. Dayal, U., Goodman, N., Katz, R.H.: An Extended Relational Algebra with Control over Duplicate Elimination. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 117–123. ACM Press, New York (1982)

    Google Scholar 

  50. de Bruijn, J., Franconi, E., Tessaris, S.: Logical Reconstruction of RDF and Ontology Languages. In: Fages, F., Soliman, S. (eds.) PPSWR 2005. LNCS, vol. 3703, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  51. Debray, S., Ramakrishnan, R.: Abstract Interpretation of Logic Programs Using Magic Transformations. Journal of Logic Programming 18, 149–176 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  52. Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science B: Formal Methods and Semantics, ch. 6, pp. 243–309. Elsevier Science, Amsterdam (1990)

    Google Scholar 

  53. Deutsch, A., Tannen, V.: Containment and Integrity Constraints for XPath Fragments. In: KRDB. Proc. Int’l. Workshop on Knowledge Representation meets Databases (2001)

    Google Scholar 

  54. Dietrich, S.W.: Extension Tables: Memo Relations in Logic Programming. In: SLP. Proc. Symposium on Logic Programming, pp. 264–272 (1987)

    Google Scholar 

  55. Dong, G., Libkin, L., Wong, L.: Local Properties of Query Languages. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 140–154. Springer, Heidelberg (1996)

    Google Scholar 

  56. Doorenbos, R.B.: Production Matching for Large Learning Systems. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1995)

    Google Scholar 

  57. Dowling, W.F., Gallier, J.H.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming 1(3), 267–284 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  58. Drabent, W.: Completeness of SLDNF-Resolution for Non-Floundering Queries. In: Proc. International Symposium on Logic Programming, p. 643 (1993)

    Google Scholar 

  59. Dwork, C., Kanellakis, P., Mitchell, J.: On the Sequential Nature of Unification. Journal of Logic Programming 1, 35–50 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  60. Dwork, C., Kanellakis, P., Stockmeyer, L.: Parallel Algorithms for Term Matching. SIAM Journal of Computing 17(4), 711–731 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  61. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)

    Google Scholar 

  62. Eiter, T., Gottlob, G.: Propositional Circumscription and Extended Closed World Reasoning are \(\Pi^{P}_{2}\)-complete. Theoretical Computer Science 114(2), 231–245 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  63. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15(3/4), 289–323 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  64. Eiter, T., Gottlob, G., Mannila, H.: Adding Disjunction to Datalog. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 267–278. ACM Press, New York (1994)

    Google Scholar 

  65. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)

    Article  Google Scholar 

  66. Fagin, R.: Finite-Model Theory — a Personal Perspective. Theoretical Computer Science 116, 3–31 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  67. Fan, C., Dietrich, S.W.: Extension Table Built-ins for Prolog. Software — Practice and Experience 22(7), 573–597 (1992)

    Article  Google Scholar 

  68. Fernandez, M.F., Suciu, D.: Optimizing Regular Path Expressions Using Graph Schemas. In: ICDE. Proc. International Conference on Data Engineering, pp. 14–23. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  69. Fitting, M.: Fixpoint Semantics For Logic Programming – A Survey. Theoretical Computer Science 278, 25–51 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  70. Flesca, S., Furfaro, F., Masciari, E.: On the Minimization of XPath Queries. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) Databases, Information Systems, and Peer-to-Peer Computing. LNCS, vol. 2944, pp. 153–164. Springer, Heidelberg (2004)

    Google Scholar 

  71. Florescu, D., Levy, A., Suciu, D.: Query Containment for Conjunctive Queries with Regular Expressions. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 139–148. ACM Press, New York (1998)

    Chapter  Google Scholar 

  72. Forgy, C.L.: Rete: a Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Expert systems: a software methodology for modern applications, pp. 324–341 (1990)

    Google Scholar 

  73. Furche, T., Linse, B., Bry, F., Plexousakis, D., Gottlob, G.: RDF Querying: Language Constructs and Evaluation Methods Compared. In: Barahona, P., Bry, F., Franconi, E., Henze, N., Sattler, U. (eds.) Reasoning Web. LNCS, vol. 4126, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  74. Gallagher, J.P.: Tutorial on Specialisation of Logic Programs. In: PEPM. Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, pp. 88–98. ACM Press, New York (1993)

    Google Scholar 

  75. Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Prentice-Hall, Englewood Cliffs (2002)

    Google Scholar 

  76. Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)

    MATH  Google Scholar 

  77. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. International Conference and Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  78. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)

    Google Scholar 

  79. Gottlob, G., Papadimitriou, C.: On the Complexity of Single-rule Datalog Queries. Information and Computation 183, 104–122 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  80. Grädel, E.: Capturing Complexity Classes with Fragments of Second Order Logic. Theoretical Computer Science 101, 35–57 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  81. Grädel, E., Otto, M.: On Logics with Two Variables. Theoretical Computer Science 224(1-2), 73–113 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  82. Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Computing Surveys 25(2), 73–169 (1993)

    Article  Google Scholar 

  83. Grumbach, S., Milo, T.: Towards Tractable Algebras for Bags. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 49–58. ACM Press, New York (1993)

    Google Scholar 

  84. Grumbach, S., Vianu, V.: Tractable Query Languages for Complex Object Databases. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 315–327. ACM Press, New York (1991)

    Google Scholar 

  85. Gurevich, Y.: Logic and the Challenge of Computer Science. In: Börger, E. (ed.) Current Trends in Theoretical Computer Science, ch. 1, pp. 1–57. Computer Science Press (1988)

    Google Scholar 

  86. Gurevich, Y., Shelah, S.: Fixpoint Extensions of First-Order Logic. Annals of Pure and Applied Logic 32, 265–280 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  87. Hayes, P.: RDF Model Theory. Recommendation, W3C (2004)

    Google Scholar 

  88. Hinrichs, T., Genesereth, M.: Herbrand Logic. Technical Report LG-2006-02, Stanford Logic Group, Computer Science Department, Stanford University (November 2006)

    Google Scholar 

  89. Immerman, N.: Relational Queries Computable in Polynomial Time. Information and Control 68, 86–104 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  90. Immerman, N.: Languages that Capture Complexity Classes. SIAM Journal of Computing 16, 760–778 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  91. Ioannidis, Y.E., Ramakrishnan, R.: Containment of Conjunctive Queries: Beyond Relations as Sets. ACM Transactions on Database Systems 20(3), 288–324 (1995)

    Article  Google Scholar 

  92. Jaeschke, G., Schek, H.J.: Remarks on the Algebra of Non First Normal Form Relations. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 124–138. ACM Press, New York (1982)

    Google Scholar 

  93. Jaffar, J., Lassez, J.-L., Lloyd, J.: Completeness of the Negation as Failure Rule. In: IJCAI. Proc. International Joint Conference on Artificial Intelligence, pp. 500–506 (1983)

    Google Scholar 

  94. Johnson, D.S.: A Catalog of Complexity Classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, Elsevier, Amsterdam (1990)

    Google Scholar 

  95. Jones, N., Laaser, W.: Complete Problems in Deterministic Polynomial Time. Theoretical Computer Science 3, 105–117 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  96. Kapur, D., Narendran, P.: Complexity of Unification Problems with Associative-commutative Operators. Journal of Automated Reasoning 9(2), 261–288 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  97. Kerisit, J.-M.: A Relational Approach to Logic Programming: the Extended Alexander Method. Theoretical Computer Science 69, 55–68 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  98. Kerisit, J.-M., Pugin, J.-M.: Efficient Query Answering on Stratified Databases. In: Proc. International Conference on Fifth Generation Computer Systems, pp. 719–726 (1988)

    Google Scholar 

  99. Khoshafian, S.N., Copeland, G.P.: Object Identity. In: Proc. International Conference on Object-oriented Programming Systems, Languages and Applications, pp. 406–416. ACM Press, New York (1986)

    Google Scholar 

  100. Klausner, A., Goodman, N.: Multirelations — Semantics and Languages. In: VLDB. Proc. International Conference on Very Large Data Bases, vol. 11, pp. 251–258. Morgan Kaufmann, San Francisco (1985)

    Google Scholar 

  101. Koch, C.: On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values. ACM Transactions on Database Systems 31(4) (2006)

    Google Scholar 

  102. Kolaitis, P., Papadimitriou, C.: Why Not Negation by Fixpoint? Journal of Computer and System Sciences 43, 125–144 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  103. Kuper, G.M., Vardi, M.Y.: The Logical Data Model. ACM Transactions on Database Systems 18(3), 379–413 (1993)

    Article  MathSciNet  Google Scholar 

  104. Le Bars, J.-M.: Counterexamples of the 0-1 Law for Fragments of Existential Second-order Logic: an Overview. Bulletin of Symbolic Logic 6(1), 67–82 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  105. Leinders, D., Marx, M., Tyszkiewicz, J., den Bussche, J.V.: The Semijoin Algebra and the Guarded Fragment. Journal of Logic, Language and Information 14(3), 331–343 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  106. Leivant, D.: Descriptive Characterizations of Computational Complexity. Journal of Computer and System Sciences 39, 51–83 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  107. Libkin, L.: On the Forms of Locality over Finite Models. In: LICS. Proc. IEEE Conference on Logic in Computer Science, pp. 204–215. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  108. Libkin, L., Wong, L.: New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 155–166. ACM Press, New York (1994)

    Google Scholar 

  109. Libkin, L., Wong, L.: Query Languages for Bags and Aggregate Functions. Journal of Computer and System Sciences 55(2), 241–272 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  110. Lindström, P.: On Extensions of Elementary Logic. Theoria 35 (1969)

    Google Scholar 

  111. Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  112. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. Logic Programming Series. MIT Press, Cambridge (1992)

    Google Scholar 

  113. Makinouchi, A.: A Consideration of Normal Form of Not-necessarily-normalized Relations in the Relational Data Model. In: VLDB. Proc. International Conference on Very Large Data Bases, pp. 447–453 (1977)

    Google Scholar 

  114. Manola, F., Miller, E.: RDF Primer. Recommendation, W3C (2004)

    Google Scholar 

  115. Marek, W., Truszczyński, M.: Autoepistemic Logic. Journal of the Association for Computing Machinery 38(3), 588–619 (1991)

    MATH  MathSciNet  Google Scholar 

  116. Martelli, A., Montanari, U.: Unification in Linear Time and Space: a Structured Presentation. Technical Report B 76-16, University of Pisa (1976)

    Google Scholar 

  117. Miklau, G., Suciu, D.: Containment and Equivalence for a Fragment of XPath. Journal of the Association for Computing Machinery 51(1), 2–45 (2004)

    MathSciNet  Google Scholar 

  118. Minker, J.: On Indefinite Data Bases and the Closed World Assumption. In: Loveland, D.W. (ed.) 6th Conference on Automated Deduction. LNCS, vol. 138, pp. 292–308. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  119. Minker, J.: Overview of Disjunctive Logic Programming. Annals of Mathematics and Artificial Intelligence 12, 1–24 (1994)

    Article  MathSciNet  Google Scholar 

  120. Minoux, M.: LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Information Processing Letters 29(1), 1–12 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  121. Narendran, P.: Unification Modulo ACI+1+0. Fundamenta Informaticae 25(1), 49–57 (1996)

    MATH  MathSciNet  Google Scholar 

  122. Nejdl, W.: Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy. In: VLDB. Proc. International Conference on Very Large Data Bases, pp. 43–50. Morgan Kaufmann Publishers Inc, San Francisco (1987)

    Google Scholar 

  123. Niemelä, I., Simons, P.: Efficient Implementation of the Well-founded and Stable Model Semantics. In: Proc. Joint International Conference and Symposium on Logic Programming, pp. 289–303 (1996)

    Google Scholar 

  124. Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking Forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  125. Papadimitriou, C.: A Note on the Expressive Power of Prolog. Bulletin of the EATCS 26, 21–23 (1985)

    MathSciNet  Google Scholar 

  126. Papadimitriou, C.: Computational Complexity. Addison-Wesley Publishing Co, Reading (1994)

    MATH  Google Scholar 

  127. Papadimitriou, C., Yannakakis, M.: A Note on Succinct Representations of Graphs. Information and Control 71, 181–185 (1985)

    Article  MathSciNet  Google Scholar 

  128. Paparizos, S., Jagadish, H.V.: Pattern Tree Algebras: Sets or Sequences. In: VLDB. Proc. International Conference on Very Large Data Bases, pp. 349–360. VLDB Endowment (2005)

    Google Scholar 

  129. Paredaens, J., Gucht, D.V.: Converting Nested Algebra Expressions into Flat Algebra Expressions. ACM Transactions on Database Systems 17(1), 65–93 (1992)

    Article  Google Scholar 

  130. Paterson, M., Wegman, M.: Linear Unification. Journal of Computer and System Sciences 16, 158–167 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  131. Plandowski, W.: Satisfiability of Word Equations with Constants is in PSPACE. In: FOCS. Proc. Annual Symposium on Foundations of Computer Science, pp. 495–500 (1999)

    Google Scholar 

  132. Przymusinsik, T.: On the Declarative Semantics of Deductive Databases and Logic Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, ch. 5, pp. 193–216. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  133. Przymusinski, T.: Stable Semantics for Disjunctive Programs. New Generation Computing 9, 401–424 (1991)

    Article  Google Scholar 

  134. Przymusinski, T.: Static Semantics for Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 14, 323–357 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  135. Przymusinski, T.C.: On the Declarative and Procedural Semantics of Logic Programs. Journal of Automated Reasoning 5(2), 167–205 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  136. Ramanan, P.: Efficient Algorithms for Minimizing Tree Pattern Queries. In: SIGMOD. Proc. ACM SIGMOD Symposium on the Management of Data, pp. 299–309. ACM Press, New York (2002)

    Chapter  Google Scholar 

  137. Reiter, R.: On Closed World Data Bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Base, pp. 55–76. Plenum Press, New York, USA (1978)

    Google Scholar 

  138. Robinson, J.: A Machine-Oriented Logic Based on the Resolution Principle. Journal of the Association for Computing Machinery 12(1), 23–41 (1965)

    MATH  MathSciNet  Google Scholar 

  139. Ross, K.: Modular Stratification and Magic Sets for Datalog Programs with Negation. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, New York (1990)

    Google Scholar 

  140. Ross, K.: A Procedural Semantics for Well-Founded Negation in Logic Programs. Journal of Logic Programming 13, 1–22 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  141. Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proc. Extreme Markup Languages (2004)

    Google Scholar 

  142. Schlipf, J.: The Expressive Powers of the Logic Programming Semantics. Journal of Computer and System Sciences 51(1), 64–86 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  143. Schwentick, T.: XPath Query Containment. SIGMOD Record 33(1), 101–109 (2004)

    Article  MathSciNet  Google Scholar 

  144. Schwichtenberg, H.: Logikprogrammierung. Institute for Mathematics, University of Munich (1993)

    Google Scholar 

  145. Sheperdson, J.: Unsolvable Problems for SLDNF-Resolution. Journal of Logic Programming 10, 19–22 (1991)

    Article  MathSciNet  Google Scholar 

  146. Shipman, D.W.: The Functional Data Model and the Data Languages DAPLEX. ACM Transactions on Database Systems 6(1), 140–173 (1981)

    Article  Google Scholar 

  147. Slivinskas, G., Jensen, C.S., Snodgrass, R.T.: Bringing Order to Query Optimization. SIGMOD Record 31(2), 5–14 (2002)

    Article  Google Scholar 

  148. Stonebraker, M., Held, G., Wong, E., Kreps, P.: The Design and Implementation of INGRES. ACM Transactions on Database Systems 1(3), 189–222 (1976)

    Article  Google Scholar 

  149. Suciu, D., Paredaens, J.: Any Algorithm in the Complex Object Algebra with Powerset needs Exponential Space to Compute Transitive Closure. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 201–209. ACM Press, New York (1994)

    Google Scholar 

  150. Tamaki, H., Sato, T.: OLDT Resolution with Tablulation. In: International Conference on Logic Programming, pp. 84–98 (1986)

    Google Scholar 

  151. Tärnlund, S.-A.: Horn Clause Computability. BIT Numerical Mathematics 17, 215–216 (1977)

    Article  MATH  Google Scholar 

  152. van den Bussche, J., Paredaens, J.: The Expressive Power of Structured Values in Pure OODBs. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 291–299. ACM Press, New York (1991)

    Google Scholar 

  153. van Emden, M., Kowalski, R.: The Semantics of Predicate Logic as a Programming Language. Journal of the Association for Computing Machinery 23(4), 733–742 (1976)

    MATH  MathSciNet  Google Scholar 

  154. van Gelder, A.: The Alternating Fixpoint of Logic Programs With Negation. In: PODS. Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 1–10. ACM Press, New York (1989)

    Google Scholar 

  155. van Gelder, A., Ross, K., Schlipf, J.: The Well-Founded Semantics for General Logic Programs. Journal of the Association for Computing Machinery 38(3), 620–650 (1991)

    MATH  MathSciNet  Google Scholar 

  156. Vardi, M.: The Complexity of Relational Query Languages. In: STOC. ACM Symposium on Theory of Computing, pp. 137–146, San Francisco (1982)

    Google Scholar 

  157. Veith, H.: Logical Reducibilities in Finite Model Theory. Master’s thesis, Information Systems Department, TU Vienna, Austria (September 1994)

    Google Scholar 

  158. Vieille, L.: A Database-Complete Proof Procedure Based on SLD-Resolution. In: International Conference on Logic Programming, pp. 74–103 (1987)

    Google Scholar 

  159. von Bültzingsloewen, G.: Translating and Optimizing SQL Queries Having Aggregates. In: VLDB. Proc. International Conference on Very Large Data Bases, pp. 235–243, San Francisco, CA, USA (1987)

    Google Scholar 

  160. Warren, D.H.D., Pereira, L.M., Pereira, F.: Prolog - the Language and its Implementation compared with Lisp. In: Proc. Symposium on Artificial Intelligence and Programming Languages, pp. 109–115 (1977)

    Google Scholar 

  161. Wood, P.T.: Optimising Web Queries using Document Type Definitions. In: WIDM. Proc. ACM Int’l. Workshop on Web Information and Data Management, pp. 28–32. ACM Press, New York (1999)

    Chapter  Google Scholar 

  162. Yasuura, H.: On Parallel Computational Complexity of Unification. In: Proc. International Conference on Fifth Generation Computer Systems, pp. 235–243. ICOT (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Informatics, University of Munich, Oettingenstraße 67, D-80538 München, Germany

    François Bry, Norbert Eisinger, Tim Furche, Clemens Ley & Benedikt Linse

  2. Institute of Information Systems, Vienna University of Technology, Favoritenstraße 11/184-3, A-1040 Vienna, URL: http://www.dbai.tuwien.ac.at/, Austria

    Thomas Eiter, Georg Gottlob, Reinhard Pichler & Fang Wei

  3. Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, England

    Georg Gottlob

Authors
  1. François Bry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norbert Eisinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tim Furche
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Georg Gottlob
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Clemens Ley
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Benedikt Linse
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Reinhard Pichler
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Fang Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grigoris Antoniou Uwe Aßmann Cristina Baroglio Stefan Decker Nicola Henze Paula-Lavinia Patranjan Robert Tolksdorf

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bry, F. et al. (2007). Foundations of Rule-Based Query Answering . In: Antoniou, G., et al. Reasoning Web. Reasoning Web 2007. Lecture Notes in Computer Science, vol 4636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74615-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74615-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74613-3

  • Online ISBN: 978-3-540-74615-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation