Directional Resolution

@inproceedings{Dechter1994DirectionalR,
  title={Directional Resolution},
  author={Rina Dechter and Irina Rish},
  year={1994}
}
The paper presents an algorithm called directional resolution, a variation on the original Davis-Putnam algorithm, and analyzes its worst-case behavior as a function of the topological structure of propositional theories. The concepts of induced width and diversity are shown to play a key role in bounding the complexity of the procedure. The importance of our analysis lies in highlighting structure-based tractable classes of satis ability and in providing theoretical guarantees on the time and… CONTINUE READING
20 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Complexity of Finding Embedding in a k-tree

  • S Arnborg, D. G. Corneil, A. Proskurowski
  • SIAM J. Algebraic Discrete Methods
  • 1987
Highly Influential
5 Excerpts

BDR-DP (bound 3) and DP-backtracking (termination at 20000 deadends) on (k;m)-trees Mean values on 50 experiments per each row DP-backtracking

  • P. van Beek, R. Dechter
  • Constraint Tightness vs Global Consistency,
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…