Artificial Intelligence - Special volume on natural language processing
On the Representation of Context
Journal of Logic, Language and Information
Open Theories and Abduction for Context and Accommodation
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
CHRv: A Flexible Query Language
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Theory and Practice of Logic Programming
Conceptual overlays: a mechanism for the interpretation of sentence meaning in context
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
The other syntax: approaching natural language semantics through logical form composition
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
Constraint Handling Rules
Adaptable Grammars for Non-Context-Free Languages
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
HYPROLOG: a new logic programming language with assumptions and abduction
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Hi-index | 0.00 |
A model for context-dependent natural language semantics is proposed and formalized in terms of possible worlds. The meaning of a sentence depends on context and at the same time affects that context representing the knowledge about the world collected from a discourse. The model fits well with a “flat” semantic representation as first proposed by Hobbs (1985), consisting basically of a conjunction of atomic predications in which all variables are existentially quantified with the widest possible scope; in our framework, this provides very concise semantic terms as compared with other representations. There is a natural correspondence between the possible worlds semantics and a constraint solver, and it is shown how such a semantics can be defined using the programming language of Constraint Handling Rules (Frühwirth, 1995). Discourse analysis is clearly a process of abduction in this framework, and it is shown that the mentioned constraint solvers serve as effective and efficient abductive engines for the purpose.