107 search results - page 14 / 22 » Planning and Patching Proof |
IJCAI
2003
15 years 1 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
96
Voted
TIME
2009
IEEE
15 years 6 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
KI
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
JAIR
2008
14 years 11 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
IJCAI
2007
15 years 1 months ago
2007
Using the achievements of my research group over the last 30+ years, I provide evidence to support the following hypothesis: By complementing each other, cooperating reasoning pro...