1 research outputs found
Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
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