Non-deterministic Algebraic Structures for Soft Computing
Abstract
Citation
Please, cite this work as:
[CCO11] I. P. Cabrera, P. Cordero, and M. Ojeda-Aciego. “Non-deterministic Algebraic Structures for Soft Computing”. In: Advances in Computational Intelligence - 11th International Work-Conference on Artificial Neural Networks, IWANN 2011, Torremolinos-Málaga, Spain, June 8-10, 2011, Proceedings, Part II. Ed. by J. Cabestany, I. Rojas and G. J. Caparrós. Vol. 6692. Lecture Notes in Computer Science. Springer, 2011, pp. 437-444. DOI: 10.1007/978-3-642-21498-1_55. URL: https://doi.org/10.1007/978-3-642-21498-1_55.
Bibliometric data
The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.
Cites
The following graph plots the number of cites received by this work from its publication, on a yearly basis.
Papers citing this work
The following is a non-exhaustive list of papers that cite this work:
[1] A. Kalampakas and O. Louscou-Bozapalidou. “Syntactic Nondeterministic Monoids”. In: Journal of Discrete Mathematical Sciences and Cryptography 18.6 (Nov. 2015), p. 717–726. ISSN: 2169-0065. DOI: 10.1080/09720529.2014.943462. URL: http://dx.doi.org/10.1080/09720529.2014.943462.
[2] P. J. Morcillo, G. Moreno, J. Penabad, et al. “Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices”. In: International Journal of Computer Mathematics 89.13–14 (Sep. 2012), p. 1742–1752. ISSN: 1029-0265. DOI: 10.1080/00207160.2012.689826. URL: http://dx.doi.org/10.1080/00207160.2012.689826.
