3446 search results - page 264 / 690 » A Reasoning Algorithm for pD* |
145
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
132
click to vote
REST
2010
ACM
15 years 10 months ago
2010
ACM
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
139
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
139
Voted
ILP
1998
Springer
15 years 9 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
171
Voted
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...