Advertisement

Controlled generation of intensional answers

  • Alain Pirotte
  • Dominique Roelants
  • Esteban Zimanyi
Data Deduction
Part of the Lecture Notes in Computer Science book series (LNCS, volume 504)

Abstract

Intensional answers are conditions that tuples of values must satisfy to belong to the usual extensional answer of a query addressed to a deductive database. This paper motivates the concept of intensional answers and introduces a general method for generating them as logical consequences of the query and of deduction rules. It then shows how integrity constraints can filter out inadequate answers and produce simpler and more informative answers. An efficient organization for the combination of answers and constraints is described. Beyond the mechanics of answer generation, the interest of the approach also depends on a strategy for selecting answers to a user submitting a query. This requires techniques for user modeling and dialogue management similar to those required for expert systems.

Keywords

Integrity Constraint Extensional Database Deductive Database Deduction Rule Relevant Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BHP89]
    Albert Bruffaerts, Eric Henin, and Alain Pirotte. A sound basis for the generation of explanations in expert systems. PHILIPS Technical Review, 44(8/9/10):287–295, May 1989.Google Scholar
  2. [CD86]
    L. Cholvy and R. Demolombe. Querying a rule base. In Proc. 1st International Conference on Expert Database Systems, Columbia, S.C., pages 365–371, 1986.Google Scholar
  3. [CD88]
    Frédéric Cuppens and Robert Demolombe. Cooperative answering: a methodology to provide intelligent access to databases. In Proc. 2nd International Conference on Expert Database Systems, Washington, D.C., pages 333–353, 1988.Google Scholar
  4. [CGM88]
    U. S. Chakravarthy, J. Grant, and Jack Minker. Foundations of semantic query optimization for deductive databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 243–273, Morgan Kaufmann, 1988.Google Scholar
  5. [Cho87]
    Laurence Cholvy. Interrogation d'une base de règles. Rapport final 2/3274/DERI, ONERA-CERT, February 1987. (in French).Google Scholar
  6. [Gal89]
    Annie Gal. Construction de Réponses Coopératives, à l'aide de Contraintes d'Intégrité, dans des Bases de Données Logiques. PhD thesis, Université de Rennes, 1989.Google Scholar
  7. [GM87]
    Annie Gal and Jack Minker. Informative and Cooperative Answers in Databases Using Integrity Constraints. Technical Report CS-TR-1911, University of Maryland, September 1987.Google Scholar
  8. [GMN84]
    Hervé Gallaire, Jack Minker, and Jean-Marie Nicolas. Logic and databases: a deductive approach. ACM Computing Surveys, 16(2):153–185, June 1984.Google Scholar
  9. [HPRV89]
    Guy Hulin, Alain Pirotte, Dominique Roelants, and Marc Vauclair. Logic and databases. In André Thayse, editor, From Modal Logic to Deductive Databases, pages 279–350, Wiley, 1989.Google Scholar
  10. [Imi87]
    Tomasz Imieliński. Intelligent query answering in rule based systems. Journal of Logic Programming, 4:229–257, 1987.Google Scholar
  11. [Klu88]
    Anthony Klug. On conjunctive queries containing equalities. Journal of the ACM, 35(1):146–160, January 1988.Google Scholar
  12. [Lee67]
    C. Lee. A Completeness Theorem and a Computer Program for Finding Theorems Derivable from given Axioms. PhD thesis, University of California, Berkeley, 1967.Google Scholar
  13. [Mot89]
    Amihai Motro. Using integrity constraints to provide intensional answers to relational queries. In Proc. 15th International Conference on Very Large Databases, pages 237–246, Amsterdam, 1989.Google Scholar
  14. [PRZ91]
    Alain Pirotte, Dominique Roelants, and Esteban Zimányi. Controlled generation of intensional answers. 1991. To appear in the IEEE Transactions on Data and Knowledge Engineering.Google Scholar
  15. [Rei84]
    Raymond Reiter. Towards a logical reconstruction of relational database theory. In Michael Brodie, John Mylopoulos, and Joachim Schmidt, editors, On Conceptual Modelling, pages 191–238, Springer-Verlag, Berlin, 1984.Google Scholar
  16. [SM88]
    Chung-Dak Shum and Richard Muntz. Implicit representation for extensional answers. In Proc. 2nd International Conference on Expert Database Systems, Washington, D.C., pages 257–273, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Alain Pirotte
    • 1
  • Dominique Roelants
    • 1
  • Esteban Zimanyi
    • 2
  1. 1.Philips Research Laboratory BelgiumLouvain-la-NeuveBelgium
  2. 2.Université Libre de BruxellesBrusselsBelgium

Personalised recommendations