A logic-based calculus of events
New Generation Computing
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
Learning Probabilistic Models of Relational Structure
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Monotonic semantic interpretation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
The role of lexico-semantic feedback in open-domain textual question-answering
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Logic form transformation of WordNet and its applicability to question answering
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Entailment, intensionality and text understanding
HLT-NAACL-TEXTMEANING '03 Proceedings of the HLT-NAACL 2003 workshop on Text meaning - Volume 9
Balancing clarity and efficiency in typed feature logic through delaying
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
CONTEXT'05 Proceedings of the 5th international conference on Modeling and Using Context
Informing datalog through language intelligence --- a personal perspective
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
This paper presents a comprehensive, constraint-based formalism for natural language syntax that supports genuinely semantic interpretation. It does so by carefully distinguishing the semantically referential parts of constituency in phrase structure from those that reason about word order and contiguity, by assigning logical expressions to phrases that are drawn from the common semantic language of two-sorted type theory (Ty2), by defining an extension of typed feature logic (TFL) for making underspecified descriptions of these semantic terms, and by allowing for general inference to take place over these logical expressions. Both well-formedness in the underspecified semantic description language and real-world inference among the fully resolved Ty2 terms denoted by those descriptions can be conducted by closure over algebras of Constraint Handling Rules [1] in a logic programming implementation.