522 search results - page 21 / 105 » Real-time Logics: Complexity and Expressiveness |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
IJCAI
2001
13 years 9 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
DLOG
2003
13 years 9 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
KR
2004
Springer
14 years 1 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...