618 search results - page 21 / 124 » Computational Models of Natural Language Argument |
DALT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
MODELS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Separation of Concerns (SoC) is an important issue to reduce the complexity of software. Recent advances in programming language research show that Aspect-Oriented Progra...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
CICLING
2005
Springer
14 years 29 days ago
2005
Springer
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
MODELS
2007
Springer
14 years 1 months ago
2007
Springer
Recently, the complexity of modern, real-time computer games has increased drastically. The need for sophisticated game AI, in particular for Non-Player Characters, grows with the ...