On Reachability of Minimal Models of Multilattice-Based Logic Programs

 

Abstract

Citation

Please, cite this work as:

[MOR07] J. Medina, M. Ojeda-Aciego, and J. Ruiz-Calvi~no. “On Reachability of Minimal Models of Multilattice-Based Logic Programs”. In: MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings. Ed. by A. F. Gelbukh and A. F. K. Morales. Vol. 4827. Lecture Notes in Computer Science. Springer, 2007, pp. 271-282. DOI: 10.1007/978-3-540-76631-5_26. URL: https://doi.org/10.1007/978-3-540-76631-5_26.

BibTeX

@InProceedings{Medina2007c,
     author = {Jes{’u}s Medina and Manuel Ojeda-Aciego and Jorge Ruiz-Calvi~no},
     booktitle = {{MICAI} 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings},
     title = {On Reachability of Minimal Models of Multilattice-Based Logic Programs},
     year = {2007},
     editor = {Alexander F. Gelbukh and Angel Fernando Kuri Morales},
     pages = {271–282},
     publisher = {Springer},
     series = {Lecture Notes in Computer Science},
     volume = {4827},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/micai/MedinaOR07.bib},
     doi = {10.1007/978-3-540-76631-5_26},
     timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
     url = {https://doi.org/10.1007/978-3-540-76631-5_26},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

On Reachability of Minimal Models of Multilattice-Based Logic Programs

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

[2] G. Moreno, J. Penabad, and C. Vázquez. “Beyond multi-adjoint logic programming”. In: International Journal of Computer Mathematics 92.9 (Nov. 2014), p. 1956–1975. ISSN: 1029-0265. DOI: 10.1080/00207160.2014.975218. URL: http://dx.doi.org/10.1080/00207160.2014.975218.