Sciweavers

130 search results - page 23 / 26
» Making Semantic Interpretation Parser-Independent
Sort
View
ACL
1990
14 years 10 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
93
Voted
ECAI
1994
Springer
15 years 1 months ago
Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
Giuseppe De Giacomo, Maurizio Lenzerini
EACL
1993
ACL Anthology
14 years 11 months ago
Resolving Zero Anaphora in Japanese
The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of a...
Tadashi Nomoto, Yoshihiko Nitta
DLS
2008
264views Languages» more  DLS 2008»
14 years 10 months ago
Contextual values
Context-oriented programming proposes to treat execution context explicitly and to provide means for context-dependent adaptation at runtime. There are many mechanisms that can be...
Éric Tanter
POPL
2006
ACM
15 years 9 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan