Skip to main content

A Procedural Semantics for Multi-adjoint Logic Programming

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2001)

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

Included in the following conference series:

Abstract

Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multi- adjoint logic programming and completeness theorems are proved.

Partially supported by Spanish DGI project BFM2000-1054-C02-02 and Junta de Andalucía project TIC-115.

Partially supported by Slovak project VEGA 1/7557/20

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.V. Damásio and L. Moniz Pereira. Monotonic and residuated logic programs. In Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU’01, pages 748–759. Lect. Notes in Artificial Intelligence, 2143, Springer-Verlag, 2001.

    Google Scholar 

  2. M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. of Logic Programming, 12:335–367, 1992.

    Article  MathSciNet  Google Scholar 

  3. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. A completeness theorem for multi-adjoint logic programming. In Proc. FUZZ-IEEE’01. The 10th IEEE International Conference on Fuzzy Systems, IEEE Press, 2001. To appear.

    Google Scholar 

  4. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. A multi-adjoint logic approach to abductive reasoning. In Proc. 17th International Conference on Logic Programming, ICLP’01. Lect. Notes in Artificial Intelligence 2273, Springer-Verlag, 2001.

    Google Scholar 

  5. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. Multi-adjoint logic programming with continuous semantics. In Proc. Logic Programming and Non-Monotonic Reasoning, LPNMR’01, pages 351–364. Lect. Notes in Artificial Intelligence, 2173, Springer-Verlag, 2001.

    Google Scholar 

  6. E. Naito, J. Ozawa, I. Hayashi, and N. Wakami. A proposal of a fuzzy connective with learning function. In P. Bosc and J. Kaczprzyk, editors, Fuzziness Database Management Systems, pages 345–364. Physica Verlag, 1995.

    Google Scholar 

  7. P. Vojtáš and L. Paulík. Soundness and completeness of non-classical extended SLD-resolution. In Proc. Extensions of Logic Programming, pages 289–301. Lect. Notes in Comp. Sci. 1050, Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Medina, J., Ojeda-Aciego, M., Vojtáš, P. (2001). A Procedural Semantics for Multi-adjoint Logic Programming. In: Brazdil, P., Jorge, A. (eds) Progress in Artificial Intelligence. EPIA 2001. Lecture Notes in Computer Science(), vol 2258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45329-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45329-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43030-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics