Graph-based Interpretation of Normal Logic Programs
summary
Proposes a graph encoding that adds an explicit conjunction node to capture rule bodies, shows how negating edges (De Morgan) transforms that graph back into an equivalent normal program, and then augments the retranslated program with small ASP interpreter rules so CLINGO computes different semantics. Demonstrates that co-stable model semantics yields the extra fixed point missing from stable models and that well-founded semantics produces unknowns for even loops; reports an implementation and performance results.
AI-written summary · about