Before we can state the definition of D-WFS we have to extend our principles to disjunctive programs with default-negation.
Disjunctive Logic Program
A disjunctive logic program consists of a finite number of rules of the form
where A1,…,Ak, B1,…,Bm,C1,…,Cn are positive atoms (containing possibly free variables). We call A1∨…Ak the head of the rule, B1,…,Bm its positive body and C1,…,Cn its negative body. The comma represents conjunction ∧.
We abbreviate these rules by
With Safari, you learn the way you learn best. Get unlimited access to videos, live online training,
learning paths, books, interactive tutorials, and more.