1220 search results - page 17 / 244 » Restricting grammatical complexity |
KI
2006
Springer
13 years 7 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
LCC
1994
13 years 11 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, I will show how a controlled natural language can be used to describe knowledge for the Semantic Web and discuss the formal properties of this language. At the firs...
COLING
1992
13 years 8 months ago
1992
Recent theoretical descriptions of the Icelandic case system distinguish between lexicai and structural case. Lexical case is assigned in ttle lexiCOIl, whereas structural case is...
ENTCS
2008
13 years 7 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...