Semantic query optimization through abduction and constraint handling | SpringerLink
Skip to main content
Springer Nature Link
Log in

Semantic query optimization through abduction and constraint handling

  • Conference paper
  • First Online:
Flexible Query Answering Systems (FQAS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1495))

Included in the following conference series:

Abstract

The use of integrity constraints to perform Semantic Query-Optimization (SQO) in deductive databases can be formalized in a way similar to the use of integrity constraints in Abductive Logic Programming (ALP) and the use of Constraint Handling Rules in Constraint Logic Programming (CLP). Based on this observation and on the similar role played by, respectively, extensional, abducible and constraint predicates in SQO, ALP and CLP, we present a unified framework from which (variants of) SQO, ALP and CLP can be obtained as special instances. The framework relies on a proof procedure which combines backward reasoning with logic programming clauses and forward reasoning with integrity constraints.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdennadher, S.; Schütz, H.: CHRv: A Flexible Query Language. In this volume.

    Google Scholar 

  2. Bressan, S.; Goh, C. H.: Answering Queries in Context. In this volume.

    Google Scholar 

  3. Chakravarthy, U. S.; Grant, J.; Minker, J.: Foundations of Semantic Query Optimization for Deductive Databases. In: Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming, pp. 243–273, Morgan Kaufmann 1988

    Google Scholar 

  4. Chakravarthy, U. S.; Grant, J.; Minker, J.: Logic-Based Approach to Semantic Query Optimization, ACM Transactions on Database Systems 15 (2), pp. 162–207, 1990

    Article  Google Scholar 

  5. Clark, K. L.: Negation as failure. In: Gallaire, H.; Minker, J. (eds.): Logic and Data Bases, pp. 292–322, Plenum Press 1978

    Google Scholar 

  6. Denecker, M.; De Schreye, D.: SLDNFA: an abductive procedure for abductive logic programs, Journal of Logic Programming 34 (2), pp. 111–167, 1997

    Article  Google Scholar 

  7. Frühwirth, T.: Constraint Handling Rules. In: Podelski, A. (ed.): Constraint Programming: Basic and Trends, pp. 90–107, LNCS 910, Springer Verlag 1995

    Google Scholar 

  8. Fung, T. H.: Abduction by Deduction. Ph.D. Thesis, Imperial College 1996

    Google Scholar 

  9. Fung, T. H.; Kowalski, R. A.: The Iff Proof Procedure for Abductive Logic Programs, Journal of Logic Programming 33 (2), pp. 151–165, 1997

    Article  MATH  MathSciNet  Google Scholar 

  10. Gaasterland, T.; Lobo, J.: Processing Negation and Disjunction in Logic Programs Through Integrity Constraints, Journal of Intelligent Information Systems 2, pp. 225–243, 1993

    Article  Google Scholar 

  11. Godfrey, P.; Grant, J.; Gryz, J.; Minker, J.: Integrity Constraints: Semantics and Applications. To appear in: Chomicki, J.; Saake, G.: Logics for Databases and Information Systems, Kluwer 1998

    Google Scholar 

  12. Janson, S.; Haridi, S.: Programming Paradigms of the Andorra kernel language, Saraswat, V.; Ueda, K. (eds.): Proc. of the Int. Symp. on Logic Programming, pp. 167–186, MIT Press 1991

    Google Scholar 

  13. Jaffar, J.; Lassez, J.-L.: Constraint Logic Programming, Proc. of the 14 th ACM Symp. on the Principles of Programming Languages, pp. 111–119, 1987

    Google Scholar 

  14. Jaffar, J.; Maher, M.: Constraint Logic Programming: A Survey, Journal of Logic Programming 19/20, pp. 503–581, 1994

    Article  MathSciNet  Google Scholar 

  15. Jourdan, J.; Sola, T.: The Versatility of Handling Disjunctions as Constraints. In: Bruynooghe, M.; Penjam, J. (eds.): Proc. of the 5 th Intern. Symp. on Programming Languages Implementation and Logic Programming, pp. 60–74, Springer Verlag 1993

    Google Scholar 

  16. Kakas, A. C.: Deductive Databases as Theories of Belief, Technical Report, Imperial College, 1991

    Google Scholar 

  17. Kakas, A. C.: On the Evolution of Deductive Databases, Technical Report, Imperial College, 1991

    Google Scholar 

  18. Kakas, A. C.; Kowalski, R. A.; Toni, F.: Abductive Logic Programming, Journal of Logic and Computation 2 (6), pp. 719–770, 1992

    MATH  MathSciNet  Google Scholar 

  19. Kakas, A. C.; Kowalski, R. A.; Toni, F.: The role of abduction in logic programming. To appear in: Gabbay, D. M. et al. (eds.): Handbook of logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324, Oxford University Press 1998

    Google Scholar 

  20. Kakas, A. C.; Michael, A.: Integrating Abductive and Constraint Logic Programming. In: Sterling, L. (ed.): Proc. of the 12 th Int. Conf. on Logic Programming, pp. 399–413, MIT Press 1995

    Google Scholar 

  21. Kowalski, R. A.; Sadri, F.: Logic Programs with Exceptions. In: Warren, D. H. D.; Szeredi, P. (eds.): Proc. of the 7 th Int. Conf. on Logic Programming, pp. 598–613, MIT Press 1990

    Google Scholar 

  22. Kowalski, R. A.; Toni, F.; Wetzel, G.: Executing Suspended Logic Programs, to appear in a special issue of Fundamenta Informaticae ed. by K. Apt.

    Google Scholar 

  23. Lakshmanan, L. V. S.; Missaoui, R.: Pushing Semantics into Recursion: A General Framework for Semantic Optimization of Recursive Queries. In: Proc. of the Intern. Conf. on Data Engineering, Taiwan, 1995

    Google Scholar 

  24. Manthey, R.; Bry, F.: SATCHMO: A Theorem Prover Implemented in PROLOG. In: Lusk, E.; Overbeek, R. (eds.): Proc. of the 9 th Conf. on Automated Deduction, pp. 415–434, LNCS 310, Springer-Verlag 1988

    Google Scholar 

  25. Martelli, A., Montanari, U.: An efficient unification algorithm, ACM Trans. on Prog. Lang, and Systems 4 (2), pp. 258–282, 1982

    Article  MATH  Google Scholar 

  26. McDermott, J.: R1: A Rule-Based Configurer of Computer Systems, Artificial Intelligence 19 (1), pp. 39–88, 1982

    Article  Google Scholar 

  27. Maim, E.: Abduction and Constraint Logic Programming, In: Neumann, B. (ed.): Proc. of the 10 th European Conf. on Artificial Intelligence, 1992

    Google Scholar 

  28. Pirotte, A.; Roelants, D.; Zimányi, E.: Controled generation of intensional answers, IEEE Trans. on Knowledge and Data Engineering, 3 (2), pp. 221–236, 1991

    Article  Google Scholar 

  29. Ross, K. A.; Srivastava, D.; Stuckey, P. J.; Sudarshan, S.: Foundations of Aggregation Constraints, Theoretical Computer Science 193 (1–2), pp. 149–179, 1998

    Article  MATH  MathSciNet  Google Scholar 

  30. Van Hentenryck, P.; Saraswat, V. A.; Deville, Y.: Design, Implementation, and Evaluation of the Constraint Language cc(FD). In: Podelski, A. (ed.): Constraint Programming: Basic and Trends, pp. 293–316, Springer Verlag 1995

    Google Scholar 

  31. Wetzel, G.: Abductive and Constraint Logic Programming, Ph.D. thesis, Imperial College 1997

    Google Scholar 

  32. Wetzel, G.: A Unifying Framework for Abductive and Constraint Logic Programming. In: Bry, F.; Freitag, B.; Seipel, D. (eds.): 12 th Workshop on Logic Programming (WLP'97), pp. 58–68, LMU München 1997

    Google Scholar 

  33. Wetzel, G.: Using Integrity Constraints as Deletion Rules. In A. Bonner et al. (eds): Proceedings of the DYNAMICS'97 post-conference (ILPS'97) workshop on (Trans)Actions and Change in Logic Programming and Deductive Databases

    Google Scholar 

  34. Wetzel, G.; Kowalski, R. A.; Toni, F.: PROCALOG — Programming with Constraints and Abducibles in Logic. In: Maher, M. (ed.): Proc. of the 1996 Joint Int. Conf. and Symp. on Logic Programming, p. 535

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logic Based Systems Lab, Department of Computer Science, Brooklyn College, 11210, NY, USA

    Gerhard Wetzel

  2. Department of Computing, Imperial College, SW7 2BZ, London, UK

    Francesca Toni

Authors
  1. Gerhard Wetzel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesca Toni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Troels Andreasen Henning Christiansen Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wetzel, G., Toni, F. (1998). Semantic query optimization through abduction and constraint handling. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 1998. Lecture Notes in Computer Science, vol 1495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056017

Download citation

  • DOI: https://doi.org/10.1007/BFb0056017

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65082-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation