BIROn - Birkbeck Institutional Research Online

    Complexity analysis of heuristic CSP search algorithms

    Razgon, Igor (2005) Complexity analysis of heuristic CSP search algorithms. In: Hnich, B. and Carlsson, M. and Fages, F. and Rossi, F. (eds.) Recent Advances in Constraints: CSCLP 2005. Lecture Notes in Computer Science 3978. Springer, pp. 88-99. ISBN 9783540342151.

    Full text not available from this repository.

    Abstract

    CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O *(d n ), where n and d are the number of variables and the maximal domain size of the underlying CSP, respectively. In this paper we show that a combination of heuristic methods of constraint solving can reduce the time complexity. In particular, we prove that the FC-CBJ algorithm combined with the fail-first variable ordering heuristic (FF) achieves time complexity of O *((d – 1) n ), where n and d are the number of variables and the maximal domain size of the given CSP, respectively. Furthermore, we show that the combination is essential because neither FC-CBJ alone nor FC with FF achieve the above complexity. The proposed results are interesting because they establish connection between theoretical and practical approaches to CSP research.

    Metadata

    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 11 Oct 2021 12:10
    Last Modified: 09 Aug 2023 12:52
    URI: https://eprints.bbk.ac.uk/id/eprint/46244

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    89Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item