Skip to main content
SpringerLink
Log in

Dynamization of backtrack-free search for the constraint satisfaction problem

  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 778))

Included in the following conference series:

  • 156 Accesses

Abstract

Many AI tasks can be formulated as a Constraint Satisfaction Problem (CSP), i.e. the problem of finding an assignment of values for a set of variables subject to a given collection of constraints. In this framework each constraint is defined over a set of variables and specifies the set of allowed combinations of values as a collection of tuples.

In some cases the knowledge of the problem defined by the set of constraints may vary along the time. In particular one might be interested in further restrictions i.e. in deletions of values from existing constraints, or in introducing new ones.

In general the problem to find a solution to a CSP is NP-complete, but there exist some cases that can be solved efficiently. In this paper we consider classes of problems with a tractable solution, and present dynamic algorithms that solve this problem efficiently and are shown to be optimal.

Work supported by the ESPRIT II Basic Research Action no.7141 (Alcom II) and by the Italian Project “Algoritmi e Strutture di Calcolo”, Ministero dell'Università e della Ricerca Scientifica e Tecnologica.

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. A. V. Aho, J. E. Hopcroft, J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. G. Ausiello, A. D'Atri, D. Saccà. Minimal representation of directed Hypergraphs. SIAM J. Comput., 15:418–431, 1986.

    Google Scholar 

  3. C. Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973.

    Google Scholar 

  4. R. Detcher. Enhancement schemes for constraint processing: Backjumping, Learning and Cutset decomposition. Artificial Intelligence, 41, 1989.

    Google Scholar 

  5. R. Detcher, J. Pearl. Network based heuristic for constraint satisfaction problems. Artificial Intelligence, 34, 1988.

    Google Scholar 

  6. E. C. Freuder. Synthesizing constraint expression. Commun. ACM, 21, 11, 1978.

    Google Scholar 

  7. E. C. Freuder. A sufficient condition for Backtrack-free search. J. ACM, 29, 1, 1982.

    Google Scholar 

  8. E. C. Freuder. A sufficient condition for Backtrack-bounded search. J. ACM, 32, 4, 1985.

    Google Scholar 

  9. E. C. Freuder, A. K. Mackworth. The complexity of some polynomial network consistency algorithms for Constraint Satisfaction Problems. Artificial Intelligence, 25, 1985.

    Google Scholar 

  10. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8, 1977.

    Google Scholar 

  11. U. Montanari. Network of constraints: fundamental properties and application to picture processing. Information Science, 7:95–132, 1974.

    Google Scholar 

  12. U. Montanari, F. Rossi. An efficient algorithm for the solution of hierarchical networks of constraints. Lecture Notes in Computer Science, 291, Springer Verlag, Berlin, 1986.

    Google Scholar 

  13. U. Montanari, F. Rossi. Fundamental properties of networks of constraints: a new formulation. In: L. Kanal and V. Kumar, eds., Search in Artificial Intelligence, Springer Verlag, Berlin, 426–449, 1988.

    Google Scholar 

  14. U. Montanari, F. Rossi. Constraint relaxation may be perfect, Artificial Intelligence, 48, 1991.

    Google Scholar 

  15. U. Nanni, P. Terrevoli. A fully dynamic data structure for path expressions on dags. R.A.I.R.O. Theoretical Informatics and Applications, to appear. Technical Report ESPRIT-ALCOM.

    Google Scholar 

  16. R. E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983.

    Google Scholar 

  17. R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6:306–318, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome “La Sapienza”, via Salaria 113, I-00184, Rome, Italy

    Alberto Marchetti-Spaccamela

  2. Dipartimento di Matematica Pura ed Applicata, University of L'Aquila, via Vetoio loc. Coppito, I-67010, l'Aquila, Italy

    Daniele Frigioni & Umberto Nanni

Authors
  1. Daniele Frigioni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Bonuccelli P. Crescenzi R. Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frigioni, D., Marchetti-Spaccamela, A., Nanni, U. (1994). Dynamization of backtrack-free search for the constraint satisfaction problem. In: Bonuccelli, M., Crescenzi, P., Petreschi, R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57811-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-57811-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57811-6

  • Online ISBN: 978-3-540-48337-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation