Proceedings

Semantic Inference in Natural Language: Validating a Tractable Approach

Download BibTeX Cite

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Natural Language. Pages 1346-1352.

© 1995 International Joint Conferences on Artificial Intelligence

Abstract

This paper is concerned with an inferential approach to information extraction, reporting in particular on the results of an empirical study that was performed to validate the approach. The study brings together two lines of research: (I) the RHO framework for tractable terminological knowledge representation, and (2) the Alembic message understanding system. There are correspondingly two principal aspects of interest to this work. From the knowledge representation perspective, the present study serves to validate experimentally a normal form hypothesis that guarantees tractability of inference in the RHO framework. From the message processing perspective, this study substantiates the utility of limited inference to information extraction.

  1. Aberdeen, J., Burger, J. , Connolly, D., Roberts, S., and Vilain, M. (1993). "MITRE-Bedford: Description of the Alembic system as used for MUC-5". In [
  2. [Sundheim, 1993] .
  3. Alshawi, H. and Van Eijck, J. (1989). "Logical forms in the core language engine". In Prcdgs. of ACL89. Vancouver, BC .
  4. Bayer, S. and Vilain, M. (1991). "The relation-based know- ledge representation of King Kong". Sigart Bulletin 2(3) .
  5. Brachman, R. J. , Borgida, A. , McGuiness, D. L. , & Patel- Schneider, P. F. (1991). "Living with CLASSIC''. In Sowa, J. , ed ., Principles of Semantic Networks. San Mateo, CA: Morgan-Kaufmann.
  6. Brachman, R. J. and Levesque, H. (1984). "The tractability of subsumption in frame-based description languages". In Prcdgs. of AAA/84. Austin, TX.
  7. Brachman, R. J . and Schmolze, J . (1985) . "An overview of the KL-ONE knowledge representation system". Cog. Sci.
  8. Garey , M. R. and Johnson, D. S. (1979). Computers and Intractability. New York: W. H. Freeman. Haddock, N. J., (1992). "Semantic evaluation as constraint network consistency". In Prcdgs. of AAA/92. San Jose, CA.
  9. Hobbs, J. R. (1985). "Ontological promiscuity". In Prcdgs. of ACL85. Chicago, IL, 119-124.
  10. Hobbs, J. R. and Shieber, S. M . (1987) . "An algorithm for generating quantifier scopings". Comput. Linguistics 13(1-2).
  11. Jacobs, P. S. (1988) . "Concretion: Assumption-based under- standing". In Prcdgs. of COLINGBB. Budapest.
  12. MacGregor, R. (1991). "Inside the LOOM description classifier". Sigart Bulletin 2(3).
  13. Nebel, B. (1988). "Computational complexity of termino- logical reasoning in BACK". Artificial Intelligence 34(3).
  14. Nebel, B. (1990). "Terminological reasoning in inherently intractable". Artificial Intelligence 43.
  15. Patel-Schneider, P. F. (1989). Undecidability of subsumption in NIKL. Artificial Intelligence 39.
  16. Schmidt-SchauB, M. (1989). "Subsumption in KL-ONE is undecidable". In Prcdgs. of KR89. Toronto, ON.
  17. Stallard, D . G. (1986) . "A terminological simplification transformation for natural language question-answering systems". In Prcdgs. of ACL86. New York, NY .
  18. Sundheim, B., ed. (1992). Prcdgs. of the Fourth Message Understanding Conf (MUC-4), McLean, VA.
  19. Sundheim, B., ed. (1993 ). Prcdgs. of the Fifth Message Understanding Conf (MUC-5), Baltimore, MD.
  20. Vilain, M . (1991) . "Deduction as parsing: tractable classification in the KL-ONE framework". In Prcdgs. of AAA/91. Anaheim, CA.

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

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