Chapter of Book
Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
Author/s | Díaz Moreno, Juan Carlos
Medina, Jesús Portillo Fernández, José Ramón ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Editor | Cornejo, María Eugenia
Kóczy, László T. Medina, Jesús Barros Ruano, Antonio Eduardo de |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2019 |
Deposit Date | 2022-07-28 |
Published in |
|
ISBN/ISSN | 978-3-030-00484-2 |
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 ... 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. |
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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Díaz-Moreno2019_Chapter_Toward ... | 163.5Kb | ![]() | View/ | |