Abstract
The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved to preserve models and, moreover, some complexity results are given.
Citation
Please, cite this work as:
[MO03] J. Medina and M. Ojeda-Aciego. “Homogenizing multi-adjoint logic programs”. In: Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, Zittau, Germany, September 10-12, 2003. Ed. by M. Wagenknecht and R. Hampel. University of Applied Sciences at Zittau/Görlitz, Germany, 2003, pp. 640-644. URL: http://www.eusflat.org/proceedings/EUSFLAT_2003/papers/09Medina.pdf.
@InProceedings{Medina2003a,
author = {Jes{’u}s Medina and Manuel Ojeda-Aciego},
booktitle = {Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, Zittau, Germany, September 10-12, 2003},
title = {Homogenizing multi-adjoint logic programs},
year = {2003},
editor = {Michael Wagenknecht and Rainer Hampel},
pages = {640–644},
publisher = {University of Applied Sciences at Zittau/G{"{o}}rlitz, Germany},
abstract = {The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved to preserve models and, moreover, some complexity results are given.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/eusflat/MedinaO03.bib},
timestamp = {Thu, 07 Jan 2021 00:00:00 +0100},
url = {http://www.eusflat.org/proceedings/EUSFLAT_2003/papers/09Medina.pdf},
}