20 search results - page 2 / 4 » Solving the Entailment Problem in the Fluent Calculus Using ... |
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
IJCAI
2001
13 years 6 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
DEXA
2006
Springer
13 years 9 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
MICAI
2007
Springer
13 years 11 months ago
2007
Springer
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
CP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...