846 search results - page 78 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
116
click to vote
AI
1998
Springer
15 years 13 days ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
CONSTRAINTS
2007
15 years 21 days ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
123
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
105
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
132
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...