Tags:answer set, dependency graph, logic programming and proof of literal
Abstract:
We study syntactic conditions which guarantee when a CR-Prolog (Consistency Restoring Prolog) program has antichain property: no answer set is a proper subset of another. A notable such condition is that the program's dependency graph being acyclic and having no directed path from one cr-rule head literal to another.
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog