Conflict-Freeness (ADF)

A three-valued interpretation vv of an ADF is a conflict-free model iff for every a∈Aa \in A, v(a)=tv(a) = \mathsf{t} implies w(Ca)=tw(C_a) = \mathsf{t} for some completion w∈[v]2w \in [v]_2, and v(a)=fv(a) = \mathsf{f} implies w(Ca)=fw(C_a) = \mathsf{f} for some w∈[v]2w \in [v]_2.

Reference

Strass, H. & Wallner, J.P. (2015). Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory. Artificial Intelligence, 226, pp. 34–74.

Referenced by