Skip to main content
SpringerLink
Log in

A performance evaluation of backtrack-bounded search methods for N-ary constraint networks

  • Constraint Programming
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 689))

Included in the following conference series:

  • 118 Accesses

Abstract

An early study on the structural aspect of binary constraint problems has led to the definition of a backtrack bounded solving (BBS) method. In this paper, we apply this method to n-ary constraint problems and we try to weigh the benefits that can be expected from its use. Simple functions are described to implement BBS for acyclic n-ary problems and results of an experimental performance evaluation are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24–32, 1982.

    Google Scholar 

  2. E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4):755–761, 1985.

    Google Scholar 

  3. P. Meseguer. Constraint satisfaction problems: An overview. AICOM, 2(1):3–17, 1989.

    Google Scholar 

  4. V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1):32–44, 1992.

    Google Scholar 

  5. U. Montanari. Networks of constraints: Fundamental properties and application to picture processing. Information Science, 7(3):95–132, 1974.

    Google Scholar 

  6. A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.

    Google Scholar 

  7. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1–38, 1988.

    Google Scholar 

  8. F. Rossi, C. Petrie, and V. Dhar. On the equivalence of constraint satisfaction problems. Technical Report ACT-AI-222-89, MCC, 1989.

    Google Scholar 

  9. P. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117–133, 1983.

    Google Scholar 

  10. B. Nudel. Consistent-labeling problems and their algorithms. Artificial Intelligence, 21:135–178, 1983.

    Google Scholar 

  11. J. Gaschnig. Performance Measurement and Analysis of Certain Search Algorithms. PhD thesis, Carnegie-Mellon University, 1979.

    Google Scholar 

  12. R. Dechter and I. Meiri. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In Proc. IJCAI, Detroit, Michigan, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SECOIA Project, INRIA-CERMICS, 2004, Route des Lucioles, B.P. 93, 06902, Sophia-Antipolis Cedex

    Pierre Berlandier

Authors
  1. Pierre Berlandier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berlandier, P. (1993). A performance evaluation of backtrack-bounded search methods for N-ary constraint networks. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation