This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Controlled Generation of Intensional Answers
June 1991 (vol. 3 no. 2)
pp. 221-236

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. The authors review the concept of intensional answers and introduce a general method for generating them as logical consequences of the query and of deduction rules. The authors show 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. The introduction of negation in queries and in the body of deduction rules is discussed. 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.

[1] A. Bruffaerts, E. Henin, and A. Pirotte, "A sound basis for the generation of explanations in expert systems,"PHILIPS Tech. Rev., vol. 44, no. 8/9/10, pp. 287-295, May 1989.
[2] U. S. Chakravarthy, J. Grant, and J. Minker, "Foundations of semantic query optimization for deductive databases," inProc. Int. Workshop Foundations Deductive Databases Logic Programming, J. Minker, Ed., Aug. 1986.
[3] L. Cholvy and R. Demolombe, "Querying a rule base," inProc. 1st Int. Conf. Expert Database Syst., Columbia, SC, 1986, pp. 365-371.
[4] L. Cholvy, "Interrogation d'une base de règles," Rapport final 2/3274/DERI, ONERA-CERT, Feb. 1987 (in French).
[5] F. Cuppens and R. Demolombe, "Cooperative answering: A methodology to provide intelligent access to databases," inProc. 2nd Int. Conf. Expert Database Syst., Washington, DC, 1988, pp. 333-353.
[6] A. Gal, "Construction de réponses coopératives,àl'aide de Contraintes d'Intégrité, dans des bases de données logiques," Ph.D. dissertation, Universitéde Rennes, 1989.
[7] A. Gal and J. Minker, "Informative and cooperative answers in databases using integrity constraints," Tech. Rep. CS-TR-1911, Univ. of Maryland, Sept. 1987.
[8] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[9] G. Hulin, A. Pirotte, D. Roelants, and M. Vauclair, "Logic and databases," inFrom Modal Logic to Deductive Databases, A. Thayse, Ed. New York: Wiley, 1989, pp. 279-350.
[10] T. Imielinski, "Intelligent query answering in rule based systems,"J. Logic Programming, vol. 4, pp. 229-257, 1987.
[11] A. Klug, "On conjunctive queries containing inequalities,"JACM, vol. 35, pp. 146-160, Jan. 1988.
[12] C. Lee, "A completeness theorem and a computer program for finding theorems derivable from given axioms," Ph.D. dissertation, Univ. of California, Berkeley, 1967.
[13] A. Motro, "Using integrity constraints to provide intensional answers to relational queries," inProc. 15th Int. Conf. Very Large Databases, Amsterdam, The Netherlands, 1989, pp. 237-246.
[14] R. Reiter, "Toward a logical reconstruction of relational database theory," inOn Conceptual Modeling, M. Brodie, J. Mylopoulos, and J. Schmidt, Eds. Berlin, Germany: Springer-Verlag, 1984, pp. 191-238.
[15] C.-D. Shum and R. Muntz, "Implicit representation for extensional answers," inProc. 2nd Int. Conf. Expert Database Syst., Washington, DC, 1988, pp. 257-273.

Index Terms:
intensional answers; tuples; extensional answer; deductive database; logical consequences; query; deduction rules; integrity constraints; inadequate answers; informative answers; negation; deduction rules; answer generation; user modeling; dialogue management; expert systems; data integrity; database theory; deductive databases; logic programming
Citation:
A. Pirotte, D. Roelants, E. Zimanyi, "Controlled Generation of Intensional Answers," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 2, pp. 221-236, June 1991, doi:10.1109/69.88002
Usage of this product signifies your acceptance of the Terms of Use.