Hypergraph logic program representation versus stratified programs

Abstract

Multi-adjoint normal logic programming is a general non-monotonic logic programming framework, which makes it ideal for modeling complex scenarios. Hypergraph representation has been proved to be an appropriate tool in the study of different properties of a logic program, whereas the use of a stratification has provided interesting results related to the existence and unicity of stable models. In this paper, we will see the relation between the p-condensation graph of a program and its “optimal” stratification.