• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A Theoretical Evaluation of Selected Backtracking Algorithms (1997)

Cached

  • Download as a PDF

Download Links

  • [ai.uwaterloo.ca]
  • [cs.uwaterloo.ca]
  • [cs.uwaterloo.ca]
  • [ai.uwaterloo.ca]
  • [cs.uwaterloo.ca]
  • [cs.uwaterloo.ca]
  • [www.cs.toronto.edu]
  • [ijcai.org]
  • [ijcai.org]
  • [ijcai.org]
  • [cs.uwaterloo.ca]
  • [www.sci.tamucc.edu]
  • [www.cse.unl.edu]
  • [menaik.cs.ualberta.ca]
  • [ftp.cs.ualberta.ca]
  • [www.cs.bgu.ac.il]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Grzegorz Kondrak , Peter Van Beek
Venue:Artificial Intelligence
Citations:123 - 3 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Kondrak97atheoretical,
    author = {Grzegorz Kondrak and Peter Van Beek},
    title = {A Theoretical Evaluation of Selected Backtracking Algorithms},
    journal = {Artificial Intelligence},
    year = {1997},
    volume = {89},
    pages = {541--547}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In recent years, many new backtracking algorithms for solving constraint satisfaction problems have been proposed. The algorithms are usually evaluated by empirical testing. This method, however, has its limitations. Our paper adopts a di erent, purely theoretical approach, which is based on characterizations of the sets of search treenodes visited by the backtracking algorithms. A notion of inconsistency between instantiations and variables is introduced, and is shown to be a useful tool for characterizing such well-known concepts as backtrack, backjump, and domain annihilation. The characterizations enable us to: (a) prove the correctness of the algorithms, and (b) partially order the algorithms according to two standard performance measures: the number of nodes visited, and the number of consistency checks performed. Among other results, we prove the correctness of Backjumping and Con ict-Directed Backjumping, and show that Forward Checking never visits more nodes than Backjumping. Our approach leads us also to propose a modi cation to two hybrid backtracking algorithms, Backmarking with Backjumping (BMJ) and Backmarking with Con ict-Directed Backjumping (BM-CBJ), so that they always perform fewer consistency checks than the original algorithms. 1

Keyphrases

selected backtracking algorithm    theoretical evaluation    con ict-directed backjumping    consistency check    di erent    original algorithm    constraint satisfaction problem    modi cation    recent year    forward checking    useful tool    search treenodes    domain annihilation    standard performance measure    empirical testing    theoretical approach    well-known concept    backtracking algorithm   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University