Proceedings

Query Answering in Circumscription

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 426-430.

© 1991 International Joint Conferences on Artificial Intelligence

Abstract

We address the problem of answering queries in circumscription and related nonmonotonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem. We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation-based proof procedures.

  1. [Chang and Lee, 1973] Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical The- orem Proving. Academic Press , New York, 1973.
  2. [de Kleer, 1986] Johan de Kleer. An assumption-based TMS. Artificial Intelligence, 28 : 127-162, 1986.
  3. [Etherington, 1988] David W. Etherington. Reasoning with Incomplete Information. Pitman, London, 1988.
  4. [Geffner, 1990] Hector Geffner. Causal theories for non- monotonic reasoning. In Proceedings of the 8th AAAI, pages 524-530, Boston, MA, 1990.
  5. [Gelfond et al., 1989] Michael Gelfond, Halina Przy- musinska, and Teodor Przymusinski. On the relation- ship between circumscription and negation as failure , Artificial Intelligence, 38: 75-94, 1989.
  6. [Ginsberg, 1989] Matthew L. Ginsberg. A circumscrip- tive theorem prover. Artificial Intelligence, 39: 209- 230, 1989.
  7. [Green, 1969a] Cordell Green . Theorem-proving by res- olution as a basis for question-answering systems. In : B. Meltzer and D. Michie, editors, Machine Intelli- gence 4, pages 183-205, Edinburgh University Press, Edinburgh, 1969.
  8. [Green, 1969b] Cordell Green. Application of theorem proving to problem solving. In Proceedings of the IJ- CAI, pages 219-239, Washington D.C ., 1969. IJCAI
  9. [Inoue and Helft, 1990] Katsumi Inoue and Nicolas Helft . On theorem provers for circumscription. In Pro- ceedings of the 8th Biennial Conference of the Cana- dian Society for Computational Studies of Intelligence , pages 212-219, Ottawa, Ontario, 1990.
  10. [Inoue, 1991] Katsumi Inoue. Consequence-finding based on ordered linear resolution. In Proceedings of the 12th IJCAI, Sydney, Australia, 1991. IJCAI
  11. [Lifschitz, 1985] Vladimir Lifschitz. Computing circum- scription . In Proceedings of the 9th I JCAI, pages 121- 127, Los Angeles, CA, 1985.
  12. [McCarthy, 1986] John McCarthy. Applications of cir- cumscription to formalizing common-sense knowledge. Artificial Intellig ence, 28: 89-116, 1986.
  13. [Minicozzi and Reiter, 1972] Eliana Minicozzi and Ray- mond Reiter. A note on linear resolution strategies in consequence-finding. Artificil.l Intelligence , 3: 175- 180, 1972.
  14. [Oxusoff and Rauzy, 1989] Laurent Oxusoff and An- toine Rauzy. L'eva.luation semantique en calcul propo- sitionnel. These de Doctorat , Universite d'Aix- Marseille II, Luminy, France, 1989 .
  15. [Poole, 1989] David Poole. Explanation and prediction : an architecture for default and abductive rea.'Soning . Comp• utational Int elligen ce , 5: 97-110, 1989 .
  16. [Przymusinski, 1989] Teodor C. Przymusinski. An algo- rithm to compute circumscription. Artificial Intelli- gence, 38: 49-73, 1989.
  17. [Reiter and de Kleer, 1987] Raymond Reiter and Johan de Kleer. Foundations of assumption-based truth maintenance systems: preliminary report. In Proceed- ings of the 6th AAAI, pages 183-187, Seattle, WA, 1987.
  18. [Schlipf, 1986] John S. Schlipf. How uncomputable is general circumscription? In Proceeings of the 1st IEEE Symposium on Logic in Computer Science, pages 92-95, Cambridge, MA, 1986.
  19. [Siegel, 1987] Pierre Siegel. Representation et utilisa- tion de Ia connaissance en calcul propositionnel. These d'Etat . Universite d'Aix-Marseille II, Luminy, France, 1987.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards