1220 search results - page 16 / 244 » Restricting grammatical complexity |
DEON
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper, we present an adaptive logic for deontic conflicts, called P2.1r , that is based on Goble’s logic SDLaPe—a bimodal extension of Goble’s logic P that...
AAAI
2012
11 years 10 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
AML
1998
13 years 7 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
ANLP
2000
13 years 9 months ago
2000
Sophisticated grammar formalisms, such as LFG, allow concisely capturing complex linguistic phenomena. The powerful operators provided by such formalisms can however introduce spu...
COLING
1990
13 years 8 months ago
1990
Arabic has some special syntax features which lead to complex syntax structures. We have developed a formal description of Arabic syntax in Definite Clause Grammar. This grarnrnar...