eldorado.tu-dortmund.de/server/api/core/bitstreams/27b55c58-887b-4131-bebf-68354344fc3c/content
Example 4
Suppose an ELP P4 with the following rules:
r1: eligX ← condAAdv.
r2: eligX ←∼highLCount ,∼preTreatedN .
r3: eligX ← highLCount ,∼ctrIndR.
r4: eligX ← highLCount ,∼preTreatedM .
Program P4 describes [...] Example 7 (Example 4 continued)
Continuing Example 4, the negation of each blanket in blankets(Adv(r1)) for rule r1 in
P4 yields sets β1, . . . , β5 as shown in Table 2. Blankets β2 and β4 only contain default [...] the final solution to solve all conflicts of r1 in P4. This modification constitutes a
refinement of a suggested λ-extension.
In Sections 4.3 and 4.4, we will show that the problem of knowledge gaps will …