162 search results - page 6 / 33 » Completeness Guarantees for Incomplete Reasoners |
AIPS
2011
14 years 1 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
BPM
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we demonstrate the prototype of a modelling tool that applies graph-based rules for identifying problems in business process models. The advantages of our approach a...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 1 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
AAAI
2004
14 years 11 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
103
click to vote
HIS
2003
14 years 11 months ago
2003
– Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learni...