Artificial Intelligence - Special volume on natural language processing
Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
An empirically based system for processing definite descriptions
Computational Linguistics
TINLAP '75 Proceedings of the 1975 workshop on Theoretical issues in natural language processing
The Description Logic Handbook
The Description Logic Handbook
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
System Description: E- KRHyper
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Attempto Controlled English for Knowledge Representation
Reasoning Web
Resolving bridging references in unrestricted text
ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts
System description: E-KRHyper 1.4: extensions for unique names and description logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
Anaphora resolution in current computer-processable controlled natural languages relies mainly on syntactic information, accessibility constraints and the distance of the anaphoric expression to its antecedent. This design decision has the advantage that a text can be processed automatically without any additional ontological knowledge, but it has the disadvantage that the author is severely restricted in using anaphoric expressions while writing a text. I will argue that we can allow for a wider range of anaphoric expressions whose resolution requires inference-supporting knowledge, if we consider the anaphora resolution process as an interactive knowledge acquisition process in those cases where no suitable noun phrase antecedent can be found. In particular, I will focus on definite descriptions that stand in a synonymy, subclass/ superclass or part-whole relation to their noun phrase antecedent, and show how the original anaphora resolution algorithm of PENG Light can be extended in a systematic way in order to take care of these bridging definite descriptions. The solution to this problem also sheds some light on the adequate treatment of part-whole relations in a controlled natural language context.