1321 search results - page 184 / 265 » Subtyping in Logical Form |
173
click to vote
ACL
1989
15 years 7 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
163
click to vote
COLING
1992
15 years 7 months ago
1992
Communication among agents collaborating on a task often involves complex utterances about multiple actions. In this paper, we analyze two particular multiaction constructions, ut...
161
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
181
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...