Skip to main content
SpringerLink
Log in

Corrigendum to “Min-domain retroactive ordering for asynchronous backtracking”

  • Letter
  • Published:
Constraints Aims and scope Submit manuscript

The Original Article was published on 07 May 2008

Abstract

The asynchronous backtracking algorithm with dynamic ordering (ABT_DO), proposed in Zivan and Meisels (Constraints 11(2–3):179–197, 2006), allows changing the order of agents during distributed asynchronous complete search. In a later study (Zivan et al., Constraints 14(2):177–198, 2009), retroactive heuristics which allowed more flexibility in the selection of new orders were introduced, resulting in the ABT_DO-Retro algorithm, and a relation between the success of heuristics and the min-domain property was identified. Unfortunately, the description of the time-stampping protocol used to compare orders in ABT_DO-Retro in Zivan et al. (Constraints 14(2):177–198, 2009) is confusing and may lead to an implementation in which ABT_DO-Retro may not terminate. In this corrigendum, we demonstrate the possible undesired outcome and give a detailed and formal description of the correct method for comparing time-stamps in ABT_DO-Retro.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Bessiere, C., Maestre, A., Brito, I., & Meseguer, P. (2005). Asynchronous backtracking without adding links: A new member in the ABT family. Artificial Intelligence, 161(1–2), 7–24.

    Article  MathSciNet  MATH  Google Scholar 

  2. Hirayama, K., & Yokoo, M. (2000). The effect of nogood learning in distributed constraint satisfaction. In Proceedings of the the 20th international conference on distributed computing systems, ICDCS’00 (pp. 169–177). Washington, DC: IEEE Computer Society.

    Chapter  Google Scholar 

  3. Zivan, R., & Meisels, A. (2006). Dynamic ordering for asynchronous backtracking on DisCSPs. Constraints, 11(2–3), 179–197.

    Article  MathSciNet  MATH  Google Scholar 

  4. Zivan, R., Zazone, M., & Meisels, A. (2009). Min-domain retroactive ordering for asynchronous backtracking. Constraints, 14(2), 177–198.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMIARF, University Mohammed VAgdal, Rabat, Morocco

    Younes Mechqrane & El Houssine Bouyakhf

  2. LIRMM, University of Montpellier, Montpellier, France

    Mohamed Wahbi & Christian Bessiere

  3. Ben-Gurion University, Beer-Sheva, Israel

    Amnon Meisels & Roie Zivan

Authors
  1. Younes Mechqrane
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Wahbi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Bessiere
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. El Houssine Bouyakhf
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Amnon Meisels
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Roie Zivan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Bessiere.

Additional information

The online version of the original article can be found at http://dx.doi.org/10.1007/s10601-008-9046-z.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mechqrane, Y., Wahbi, M., Bessiere, C. et al. Corrigendum to “Min-domain retroactive ordering for asynchronous backtracking”. Constraints 17, 348–355 (2012). https://doi.org/10.1007/s10601-012-9122-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-012-9122-2

Keywords

Search

Navigation