Abstract
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part, a neural net based implementation of homogeneous propositional multi-adjoint logic programming on the unit interval has been presented elsewhere, but restricted to the case in which the only connectives involved in the program were the usual product, Gödel and Łukasiewicz together with weighted sums.
A modification of the neural implementation is presented here in order to deal with a more general family of adjoint pairs, including conjunctors constructed as an ordinal sum of a finite family of basic conjunctors. This enhancement greatly expands the scope of the initial approach, since every t-norm (the type of conjunctor generally used in applications) can be expressed as an ordinal sum of product, Gödel and Łukasiewicz conjunctors.
Partially supported by project TIC2003-09001-C02-01.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eklund, P., Klawonn, F.: Neural fuzzy logic programming. IEEE Tr. on Neural Networks 3(5), 815–818 (1992)
Hölldobler, S., Kalinke, Y.: Towards a new massively parallel computational model for logic programming. In: ECAI 1994 workshop on Combining Symbolic and Connectionist Processing, pp. 68–77 (1994)
Hölldobler, S., Kalinke, Y., Störr, H.-P.: Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11(1), 45–58 (1999)
Medina, J., Mérida-Casermeiro, E., Ojeda-Aciego, M.: A neural approach to abductive multi-adjoint reasoning. In: Scott, D. (ed.) AIMSA 2002. LNCS, vol. 2443, pp. 213–222. Springer, Heidelberg (2002)
Medina, J., Mérida-Casermeiro, E., Ojeda-Aciego, M.: A neural implementation of multiadjoint logic programming. Journal of Applied Logic 2/3, 301–324 (2004)
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)
van Emden, M.H., Kowalski, R.: The semantics of predicate logic as a programming language. Journal of the ACM 23(4), 733–742 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Medina, J., Mérida-Casermeiro, E., Ojeda-Aciego, M. (2004). Decomposing Ordinal Sums in Neural Multi-adjoint Logic Programs. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_72
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive