1220 search results - page 40 / 244 » Restricting grammatical complexity |
AIML
2004
13 years 9 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
LACL
2011
Springer
12 years 10 months ago
2011
Springer
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
SPIRE
2000
Springer
13 years 11 months ago
2000
Springer
This paper describes a word stemming algorithm for the Spanish Language. Experiments in document retrieval regarding English text suggest that word stemming based on morphological...