Sciweavers

5699 search results - page 188 / 1140
» Alternating model trees
Sort
View
ACL
2001
15 years 6 months ago
Computational Properties of Environment-based Disambiguation
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
William Schuler
COLING
1992
15 years 6 months ago
Self-Monitoring with Reversible Grammars
We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances sho...
Günter Neumann, Gertjan van Noord
138
Voted
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 5 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
TCS
2008
15 years 5 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
152
Voted
ENTCS
2002
103views more  ENTCS 2002»
15 years 4 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz