1743 search results - page 93 / 349 » Generalized Modal Satisfiability |
107
Voted
AAAI
2006
15 years 2 months ago
2006
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...
112
Voted
FCS
2006
15 years 2 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
IJCAI
2003
15 years 2 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...
106
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
89
Voted
GG
2008
Springer
15 years 1 months ago
2008
Springer
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...