{"type":"ScholarlyArticle","title":"An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction","authors":[{"name":"Mark E. Stickel","slug":"mark-e-stickel","given":"Mark E.","family":"Stickel","affiliation":""},{"name":"Mabry Tyson","slug":"mabry-tyson","given":"Mabry","family":"Tyson","affiliation":""}],"abstract":"Consecutively bounded depth-first search involves repeatedly performing exhaustive depth-first search with increasing depth bounds of 1, 2, 3, and so on. The effect is similar to that of breadth-first search, but, instead of retaining the results at Ievel n - 1 for use in computing Ievel n, earlier results are recomputed . Consecutively bounded depth-first search is useful whenever a complete search strategy is needed and either it is desirable to minimize memory requirements or depth-first search can be implemented particularly efficiently. It is notably applicable to automated deduction, especially in logic-programming systems, such as PROLOG and EQLOG, and their extensions. Consecutively bounded depth-first search, unlike unbounded breadthfirst search, can perform cutoffs by using heuristic estimates of the minimum number of steps remaining on a solution path. Even if the possibility of such cutoffs is disregarded, an analysis shows that, in general, consecutively bounded depth-first search requires only ~ times as many operations as breadthfirst search, where bis the brauehing factor.","doi":null,"url":"https://ijcai.org/proceedings/1985/218","pdf":"https://ijcai.org/proceedings/1985/0218.pdf","markdown":"https://ijcai.org/proceedings/1985/218.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/218","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":218,"pages":{"first":1073,"last":1074},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}