Skip to main content

On the Declarative Semantics of Multi-Adjoint Logic Programs

  • Conference paper
Bio-Inspired Systems: Computational and Ambient Intelligence (IWANN 2009)

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

Included in the following conference series:

Abstract

The notion of least Herbrand model has been traditionally accepted as the declarative semantics for programs in the context of pure logic programming. Some adaptations of this concept, using model-theory, were made for a few number of fuzzy logic programming frameworks in the recent years. Unfortunately, this is not the case of multi-adjoint logic programming, one of the most expressive, powerful approaches for fuzzifying logic programming. To fulfill this gap, in this paper we propose a declarative semantics for such kind of fuzzy logic programs based on the so-called least fuzzy Herbrand model. We prove and important “minimality” property of our construction which can not trivially be inherited from pure logic programming. Moreover, apart from relating our notion with other existing procedural and fix-point semantics (what is also instrumental to prove its properties), we provide evident cases where our construction exists even when the rest of the aforementioned fuzzy semantics remain undefined.

This work has been partially supported by the EU, under FEDER, and the Spanish Science and Innovation Ministry (MICIN) under grant TIN 2007-65749 and by the Castilla-La Mancha Administration under grant PII1I09-0117-4481.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Guadarrama, S., Muñoz, S., Vaucheret, C.: Fuzzy Prolog: A new approach using soft constraints propagation. Fuzzy Sets and Systems 144(1), 127–150 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ishizuka, M., Kanai, N.: Prolog-ELF Incorporating Fuzzy Logic. In: Proc. of IJCAI 1985, pp. 701–703. Morgan Kaufmann, San Francisco (1985)

    Google Scholar 

  3. Julián, P., Moreno, G., Penabad, J.: An Improved Reductant Calculus using Fuzzy Partial Evaluation Techniques. Fuzzy Sets and Systems 160(2), 162–181 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Krajči, S., Lencses, R., Vojtáš, P.: A comparison of fuzzy and annotated logic programming. Fuzzy Sets and Systems 144, 173–192 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

  6. 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 

  7. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-based Unification: a multi-adjoint approach. Fuzzy Sets and Systems 146, 43–62 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sessa, M.I.: Approximate reasoning by similarity-based SLD resolution. Fuzzy Sets and Systems 275, 389–426 (2002)

    MathSciNet  MATH  Google Scholar 

  9. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM 23(4), 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Vojtáš, P.: Fuzzy Logic Programming. Fuzzy Sets and Systems 124, 361–370 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Vojtáš, P., Paulík, L.: Soundness and completeness of non-classical extended SLD-resolution. In: Herre, H., Dyckhoff, R., Schroeder-Heister, P. (eds.) ELP 1996. LNCS, vol. 1050, pp. 289–301. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Julián, P., Moreno, G., Penabad, J. (2009). On the Declarative Semantics of Multi-Adjoint Logic Programs. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02478-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02478-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02477-1

  • Online ISBN: 978-3-642-02478-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics