A neural implementation of multi-adjoint logic programs via sf-homogenization.
Jesús Medina; Enrique Mérida-Casermeiro; Manuel Ojeda-Aciego
Mathware and Soft Computing (2005)
- Volume: 12, Issue: 2-3, page 199-216
- ISSN: 1134-5632
Access Full Article
topAbstract
topHow to cite
topMedina, Jesús, Mérida-Casermeiro, Enrique, and Ojeda-Aciego, Manuel. "A neural implementation of multi-adjoint logic programs via sf-homogenization.." Mathware and Soft Computing 12.2-3 (2005): 199-216. <http://eudml.org/doc/40868>.
@article{Medina2005,
abstract = {A generalization of the homogenization process needed for the neural implementation of multi-adjoint logic programming (a unifying theory to deal with uncertainty, imprecise data or incomplete information) is presented here. The idea is to allow to represent a more general family of adjoint pairs, but maintaining the advantage of the existing implementation recently introduced in [6]. The soundness of the transformation is proved and its complexity is analysed. In addition, the corresponding generalization of the neural-like implementation of the fixed point semantics of multi-adjoint is presented.},
author = {Medina, Jesús, Mérida-Casermeiro, Enrique, Ojeda-Aciego, Manuel},
journal = {Mathware and Soft Computing},
keywords = {Programación lógica; Lógica difusa; Redes neuronales},
language = {eng},
number = {2-3},
pages = {199-216},
title = {A neural implementation of multi-adjoint logic programs via sf-homogenization.},
url = {http://eudml.org/doc/40868},
volume = {12},
year = {2005},
}
TY - JOUR
AU - Medina, Jesús
AU - Mérida-Casermeiro, Enrique
AU - Ojeda-Aciego, Manuel
TI - A neural implementation of multi-adjoint logic programs via sf-homogenization.
JO - Mathware and Soft Computing
PY - 2005
VL - 12
IS - 2-3
SP - 199
EP - 216
AB - A generalization of the homogenization process needed for the neural implementation of multi-adjoint logic programming (a unifying theory to deal with uncertainty, imprecise data or incomplete information) is presented here. The idea is to allow to represent a more general family of adjoint pairs, but maintaining the advantage of the existing implementation recently introduced in [6]. The soundness of the transformation is proved and its complexity is analysed. In addition, the corresponding generalization of the neural-like implementation of the fixed point semantics of multi-adjoint is presented.
LA - eng
KW - Programación lógica; Lógica difusa; Redes neuronales
UR - http://eudml.org/doc/40868
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.