A general scheme for automatic generation of search heuristics from specification dependencies

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 91-131

  Kask, Kalev ^a   Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Automated reasoning; Heuristic search

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; DECISION THEORY; HEURISTIC METHODS; RANDOM PROCESSES;

BRANCH-AND-BOUND THEORY; MINI-BUCKET ELIMINATION THEORY; PARAMETERIZED APPROXIMATION METHODS;

ARTIFICIAL INTELLIGENCE;

EID: 0035369520     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00107-2     Document Type: Article

References (46)

1. Approximating probabilistic inference in Bayesian belief networks is NP-hard
2. Constraint networks
3. Bucket elimination: A unifying framework for probabilistic inference algorithms
4. Bucket elimination: A unifying framework for reasoning
5. Generalized best-first search strategies the optimality of A*
6. Network-based heuristics for constraint satisfaction problems
7. A scheme for approximating probabilistic inference
8. Partial constraint satisfaction
9. Towards an understanding of hill-climbing procedures for SAT
10. Lifted flow covers for mixed 0-1 integer programs
11. The travelling salesman problem minimum spanning trees
12. Branch bound with mini-bucket heuristics
13. Mini-Bucket heuristics for improved search
14. Stochastic local search for Bayesian networks
15. New search heuristics for Max-CSP
16. GSAT local consistency
17. Linear-space best-first search
18. Iterative decoding of compound codes by probability propagation in graphical models
19. Partition-based lower bound for Max-CSP
20. Branch-and-bound methods: A survey
21. An efficient approach for finding the MPE in belief networks
22. Near shannon limit performance of low density parity check codes
23. Turbo decoding as an instance of Pearl's belief propagation algorithm
24. Solving large scale constraint satisfaction scheduling problems using heuristic repair methods
25. The breakout method for escaping from local minima
26. Criticizing solutions to relaxed models yields powerful admissible heuristics
27. A connectionist model for diagnostic problem solving
28. Knowledge engineering for large belief networks
29. Machine discovery of effective admissible heuristics
30. Empirical evaluation of approximation algorithms for probabilistic decoding
31. On the generation of alternative explanations with implications for belief revision
32. An empirical study of greedy local search for satisfiability testing
33. Noise strategies for local search
34. A new method for solving hard satisfiability problems
35. Axioms for probability and belief-function propagation
36. A new algorithm for finding map assignments to belief networks
37. Reasoning MPE to multiply connected belief networks using message-passing
38. Russian doll search
39. Analysis of heuristic methods for partial constraint satisfaction problems