Centering: a framework for modeling the local coherence of discourse
Computational Linguistics
Automatic proofs and counterexamples for some ortholattice identities
Information Processing Letters
Autonomous Agents and Multi-Agent Systems
Training Personal Robots Using Natural Language Instruction
IEEE Intelligent Systems
A Resolution Decision Procedure for the Guarded Fragment
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
An inference-based approach to dialogue system design
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Interpreting vague utterances in context
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Mathematical domain reasoning tasks in natural language tutorial dialog on proofs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Wide-coverage semantic analysis with Boxer
STEP '08 Proceedings of the 2008 Conference on Semantics in Text Processing
Weakly supervised learning of presupposition relations between verbs
ACLstudent '10 Proceedings of the ACL 2010 Student Research Workshop
Recognising textual entailment with robust logical inference
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
Model generation in a dynamic environment
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
| Hi-index | 0.00 |
Computational aspects of Van der Sandt's binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated to meet requirements for computational implementation, which include operations on discourse representation structures (renaming and merging), the representation of presuppositions (allowing for selective binding and determining free and bound variables), and a formulation of the acceptability constraints imposed by BAT. An efficient presupposition resolution algorithm is presented, and several further improvements such as preferences for binding and accommodation are discussed and integrated in this algorithm. Finally, innovative use of first-order theorem provers to carry out consistency checking of discourse representations is investigated.