O'Reilly logo

Handbook of Automated Reasoning by Andrei Voronkov, Alan J.A. Robinson

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

4.5 D-WFS and D-STABLE

Before we can state the definition of D-WFS we have to extend our principles to disjunctive programs with default-negation.

4.21. Definition

Disjunctive Logic Program

A disjunctive logic program consists of a finite number of rules of the form

A 1 A k B 1 , , B m , n o t C 1 , , n o t C n

si597_e

where A 1 ,…,Ak, B 1 ,…,Bm,C 1 ,…,Cn are positive atoms (containing possibly free variables). We call A 1…Ak the head of the rule, B 1,,Bm its positive body and C1,,Cn its negative body. The comma represents conjunction ∧.

We abbreviate these rules by

A + , n o t

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required