Sciweavers

Share
5 search results - page 1 / 1
» Inference-Based Constraint Satisfaction Supports Explanation
Sort
View
AAAI
1996
8 years 4 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
LICS
2007
IEEE
8 years 9 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...
UAI
1997
8 years 4 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
IJCAI
1997
8 years 4 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
books