Skip to main content

Series-Parallel and Tree-Decomposition Approaches for Fuzzy Constraint Networks

  • Conference paper
  • First Online:
Advances in Artificial Intelligence — IBERAMIA 2002 (IBERAMIA 2002)

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

Included in the following conference series:

Abstract

In this work, we present a Disjunctive Fuzzy Constraint Networks model for continuous domains, which generalizes the Disjunctive Fuzzy Temporal Constraint Networks model for temporal reasoning, and we propose the use of the series-parallel and tree-decomposition approaches for simplifying its processing. After a separate empirical evaluation process of both techniques, a combined evaluation process over the same problem repository has been carried out, finding that series-parallel problems practically subsume treedecomposable problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Barro, R. Marín, and A.R. Patón, “A model and a language for the fuzzy representation and handling of time”, Fuzzy Sets and Systems, 61, 1994, pp. 153–175.

    Article  MathSciNet  Google Scholar 

  2. A. Bosch, M. Torres, I. Navarrete, and R. Marín, “Tree Decomposition of Disjunctive Fuzzy Temporal Constraint Networks”. Proc. of Computational Intelligence: Methods and Applications CIMA’2001, ICSC-NAISO, Bangor (UK), 2001, #1714–066, 7 pages.

    Google Scholar 

  3. A. Bosch, M. Torres, R. Marín. Reasoning with Disjunctive Fuzzy Temporal Constraint Networks. TIME-2002, Manchester (UK), 8 pages., 2002 (accepted).

    Google Scholar 

  4. A. Bosch, C. Martínez, F. Guil, R. Marín. Solving Fuzzy Temporal Problems Without Backtracking.. Eurasian-2002, Teherán (Irán), 10 pages., 2002 (accepted).

    Google Scholar 

  5. V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “LaTeR: a general purpose manager of temporal information”, Methodologies for intelligent systems 8, LNCS 869, Springer, 1994, pp. 255–264.

    Google Scholar 

  6. R. Dechter, “Enhancement Schemes for Constraint Processing: Backjumping, Learning and Cutset Decomposition.” Artificial Intelligence 41, Elsevier, 1990, pp. 273–312.

    Article  MathSciNet  Google Scholar 

  7. R. Dechter, I. Meiri, and J. Pearl, “Temporal constraint networks”, Artificial Intelligence 49, Elsevier, 1991, pp. 61–95.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Dechter, and J. Pearl, “Network-based heuristics for constraint-satisfaction problems”, Artificial Intelligence, 34, Elsevier, 1987, pp. 1–38

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Dubois, H. Prade, Possibility Theory: An approach to computerized processing of uncertainty, Plenum Press, New York, 1988.

    MATH  Google Scholar 

  10. S. Even, Graph Algorithms. Computer Science Press, Rockville, MD, 1979.

    MATH  Google Scholar 

  11. E. Freuder, “A sufficient condition for backtrack-free search”, Journal of the ACM29, 1, ACM Press, 1982, pp. 24–32.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Kondrak, and P. van Beek, “A Theoretical Evaluation of Selected Backtracking Algorithms”, Artificial Intelligence 89, Elsevier, 1997, pp. 365–387.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Mackworth, “Consistency in networks of relations”, Artificial Intelligence 8, Elsevier, 1977, pp. 99–118.

    Article  MATH  Google Scholar 

  14. R. Marín, S. Barro, A. Bosch, and J. Mira, “Modelling the representation of time from a fuzzy perspective”, Cybernetics and Systems, 25, 2, Taylor&Francis, 1994, pp. 207–215.

    Article  Google Scholar 

  15. R. Marín, S. Barro, F. Palacios, R. Ruiz, and F. Martin, “An Approach to Fuzzy Temporal Reasoning in Medicine”, Mathware & Soft Computing, 3, 1994, pp. 265–276.

    Google Scholar 

  16. R. Marín, M. Cardenas, M. Balsa, and J. Sanchez, “Obtaining solutions in fuzzy constraint networks”, Int. Journal of Approximate Reasoning, 16, Elsevier, 1997, pp. 261–288.

    Article  MATH  Google Scholar 

  17. I. Meiri, R. Dechter, and J. Pearl, “Uncovering trees in constraint networks”, Artificial Intelligence, 86, Elsevier, 1996, 245–267.

    Article  MathSciNet  Google Scholar 

  18. U. Montanari, “Networks of constraints: fundamental properties and applications to picture processing”, Information Science, 7, 1974, pp. 95–132.

    Article  MathSciNet  Google Scholar 

  19. I. Navarrete, R. Marín, and M. Balsa, “Redes de Restricciones Temporales Disyuntivas Borrosas”, Proceedings of ESTYLF’95, Murcia, European Society for Fuzzy Logic and Technology, (Spain), 1995, pp. 57–63

    Google Scholar 

  20. E. Schwalb, and R. Dechter, “Coping With Disjunctions on Temporal Constraint Networks”, Proc. American Association Artificial Intelligence’93, AAAI, Washington, 1993, pp. 127–132.

    Google Scholar 

  21. E. Schwalb, and R. Dechter, “Processing Disjunctions in Temporal Constraint Networks”, Artificial Intelligence 93, Elsevier, 1997, pp. 29–61.

    Article  MATH  MathSciNet  Google Scholar 

  22. E. Schwalb, and L. Vila, “Temporal Constraints: A Survey”, Constraints 3 (2/3), 1998, pp. 129–149.

    Article  MATH  MathSciNet  Google Scholar 

  23. K. Stergiou and M. Koubarakis, “Backtracking Algorithms for Disjunctions of Temporal Constraints”, Artificial Intelligence 120, Elsevier, 2000, pp. 81–117.

    Article  MATH  MathSciNet  Google Scholar 

  24. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, 1993.

    Google Scholar 

  25. Túnez, S.; DelAguila, I.; Bienvenido, F.; Bosch, A. y Marín, R.(1996). Integrating decision support and knowledge-based system: application to pest control in greenhouses. Procedings 6th International Congress for Computer Technology in Agriculture (ICCTA’96), pp. 417–422. Wageningen.

    Google Scholar 

  26. J.A. Wald, and C.J. Colburn, “Steiner Trees, Partial 2-Trees and Minimum IFI Networks”, Networks, 13, 1983, pp. 159–167.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bosch, A., Guil, F., Martinez, C., Marin, R. (2002). Series-Parallel and Tree-Decomposition Approaches for Fuzzy Constraint Networks. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-36131-6_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00131-7

  • Online ISBN: 978-3-540-36131-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics