2490 search results - page 358 / 498 » Complexity of Contextual Reasoning |
120
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
104
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
123
Voted
ESAW
2004
Springer
15 years 9 months ago
2004
Springer
The agent metaphor has shown its usefulness for modelling as well as implementing complex and dynamic applications. Although a number of agent applications has been successfully re...
126
click to vote
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
140
Voted
FOIKS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...