Languages with self-reference I: foundations (or: we can have everything in first-order logic])
Artificial Intelligence
A syntactic theory of belief and action
Artificial Intelligence
The consistency of syntactical treatments of knowledge
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The knower's paradox and representational theories of attitudes
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Paradoxes and semantic representation
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
An algorithm for generating quantifier scopings
Computational Linguistics
Knowing who
Prolog and natural-language analysis
Prolog and natural-language analysis
A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
Languages with self-reference II: knowledge, belief and modality
Artificial Intelligence
Practical parsing of generalized phrase structure grammars
Computational Linguistics
A Deduction Model of Belief
The detection and representation of ambiguities of intension and description
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Using λ-calculus to represent meanings in logic grammars
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Unification-based semantic interpretation
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Quantifier scoping in the SRI core language engine
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Indexical expressions in the scope of attitude verbs
Computational Linguistics
| Hi-index | 0.00 |
The sentential theory of propositional attitudes is very attractive to AI workers, but it is difficult to use such a theory to assign semantics to English sentences about attitudes. The problem is that a compositional semantics cannot easily build the logical forms that the theory requires. We present a new notation for a sentential theory, and a unification grammar that builds logical forms in our notation. The grammar is implemented using the standard implementation of definite clause grammars in Prolog.