955 search results - page 89 / 191 » Tractable Temporal Reasoning |
118
Voted
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
109
Voted
KR
1989
Springer
15 years 6 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
81
Voted
DLOG
2008
15 years 5 months ago
2008
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
102
Voted
IJCAI
2007
15 years 4 months ago
2007
Most AI diagnostic reasoning approaches model components and but not their interconnections, and when they do model interconnections, they model the possibility that a connection ...
102
Voted
AAAI
2004
15 years 4 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...