Towards the Use of Hypergraphs in Multi-adjoint Logic Programming

Díaz Moreno, Juan Carlos; Medina, Jesús; Portillo Fernández, José Ramón

doi:10.1007/978-3-030-00485-9_6

Capítulo de Libro

dc.contributor.editor	Cornejo, María Eugenia	es
dc.contributor.editor	Kóczy, László T.	es
dc.contributor.editor	Medina, Jesús	es
dc.contributor.editor	Barros Ruano, Antonio Eduardo de	es
dc.creator	Díaz Moreno, Juan Carlos	es
dc.creator	Medina, Jesús	es
dc.creator	Portillo Fernández, José Ramón	es
dc.date.accessioned	2022-07-28T08:04:47Z
dc.date.available	2022-07-28T08:04:47Z
dc.date.issued	2019
dc.identifier.citation	Díaz Moreno, J.C., Medina, J., y Portillo Fernández, J.R. (2019). Towards the Use of Hypergraphs in Multi-adjoint Logic Programming. En M.E. Cornejo, .T. Kóczy, J. Medina, A.E.d. Barros Ruano (Ed.), Trends in Mathematics and Computational Intelligence (pp. 53-59). Cham, Switzerland: Springer.
dc.identifier.isbn	978-3-030-00484-2	es
dc.identifier.uri	https://hdl.handle.net/11441/135941
dc.description.abstract	The representation of a logic program by a graph is a useful procedure in order to obtain interesting properties of the program and in the computation of the least model, when it exists. In this paper, we consider hypergraphs for representing multi-adjoint logic programs and, based on this representation, the hypotheses of an interesting termination result have been weakened.	es
dc.format	application/pdf	es
dc.format.extent	7	es
dc.language.iso	eng	es
dc.publisher	Springer	es
dc.relation.ispartof	Trends in Mathematics and Computational Intelligence	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Towards the Use of Hypergraphs in Multi-adjoint Logic Programming	es
dc.type	info:eu-repo/semantics/bookPart	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)	es
dc.relation.publisherversion	https://link.springer.com/chapter/10.1007/978-3-030-00485-9_6	es
dc.identifier.doi	10.1007/978-3-030-00485-9_6	es
dc.contributor.group	Universidad de Sevilla. FQM-164: Matemática Discreta: Teoría de Grafos y Geometría Computacional	es
dc.publication.initialPage	53	es
dc.publication.endPage	59	es
dc.relation.publicationplace	Cham, Switzerland	es
dc.identifier.sisius	21517060	es

Ficheros	Tamaño	Formato	Ver	Descripción
Díaz-Moreno2019_Chapter_Toward ...	163.5Kb	[PDF]	Ver/Abrir

Este registro aparece en las siguientes colecciones

Capítulos (Matemática Aplicada I)

Mostrar el registro sencillo del ítem

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional