Skip to main content

Building a Fuzzy Transformation System

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3831))

Abstract

Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. Inspired by previous approaches largely used in other (crisp) declarative paradigms, in this paper we propose the development of a fold/unfold based transformation system for optimizing such kind of fuzzy logic programs. We prove that our set of transformation rules composed by definition introduction, folding, unfolding and facting, enjoys strong correctness properties (i.e. the semantics of computed substitutions and truth degrees is preserved) and it is able to significantly improve the execution of goals against transformed programs. To the best of our knowledge, this is the first approach to the construction of a complete transformation system in a fuzzy logic setting.

This work has been partially supported by the EU, under FEDER, and the Spanish Science and Education Ministry (MEC) under grant TIN 2004-07943-C04-03.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: An Automatic Composition Algorithm for Functional Logic Programs. In: Jeffery, K., Hlaváč, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol. 1963, pp. 289–297. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Alpuente, M., Falaschi, M., Moreno, G., Vidal, G.: Rules + Strategies for Transforming Lazy Functional Logic Programs. Theoretical Computer Science 311, 479–525 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bossi, A., Cocco, N.: Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs. Journal of Logic Programming 16, 47–87 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Burstall, R.M., Darlington, J.: A Transformation System for Developing Recursive Programs. Journal of the ACM 24(1), 44–67 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gardner, P.A., Shepherdson, J.C.: Unfold/Fold Transformation of Logic Programs. In: Lassez, J.L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, pp. 565–583. The MIT Press, Cambridge (1991)

    Google Scholar 

  6. Julián, P., Moreno, G., Penabad, J.: On Fuzzy Unfolding. A Multi-Adjoint Approach. Fuzzy Sets and Systems, Elsevier 154, 16–33 (2005)

    MATH  Google Scholar 

  7. Julián, P., Moreno, G., Penabad, J.: Operational/Interpretive Unfolding of Multi-adjoint Logic Programs. In: López-Fraguas, F. (ed.) Proc. of V Jornadas sobre Programación y Lenguajes, PROLE 2005, Granada, Spain, University of Granada, September 14-16, pp. 239–248 (2005)

    Google Scholar 

  8. Lassez, J.-L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–625. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  9. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Multi-Adjoint Logic Programming with Continuous Semantics. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 351–364. Springer, Heidelberg (2001)

    Google Scholar 

  10. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: A Procedural Semantics for Multiadjoint Logic Programing. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 290–297. Springer, Heidelberg (2001)

    Google Scholar 

  11. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-Based Unification: a Multi-Adjoint Approach. Fuzzy Sets and Systems, Elsevier 146, 43–62 (2004)

    Article  MATH  Google Scholar 

  12. Moreno, G.: Automatic Optimization of Multi-Paradigm Declarative Programs. In: Garijo, F.J., Riquelme, J.-C., Toro, M. (eds.) IBERAMIA 2002. LNCS (LNAI), vol. 2527, pp. 131–140. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Moreno, G.: Transformation Rules and Strategies for Functional-Logic Programs. AI Communications 15(2, 3), 163–165 (2002)

    MathSciNet  Google Scholar 

  14. Moreno, G., Pascual, V.: Programming with Fuzzy–logic and Mathematical Functions. In: Bloch, I., Petrosino, A., Tettamanzi, A.G.B. (eds.) WILF 2005. LNCS (LNAI), vol. 3849, pp. 89–98. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Pettorossi, A., Proietti, M.: Rules and Strategies for Transforming Functional and Logic Programs. ACM Computing Surveys 28(2), 360–414 (1996)

    Article  Google Scholar 

  16. Tamaki, H., Sato, T.: Unfold/Fold Transformations of Logic Programs. In: Tärnlund, S. (ed.) Proc. of Second Int’l Conf. on Logic Programming, pp. 127–139 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moreno, G. (2006). Building a Fuzzy Transformation System. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_39

Download citation

  • DOI: https://doi.org/10.1007/11611257_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31198-0

  • Online ISBN: 978-3-540-32217-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics