Minimal founded semantics for disjunctive logic programs and deductive databases

Details Minimal founded semantics for disjunctive logic programs and deductive databases Minimal founded semantics for disjunctive logic programs and deductive databases

2003-12-15

arxiv.org/abs/cs/0312028v1

Theory and Practice of Logic Programming, 4(1): 75-93 (2004)

Computer Science

Logic in Computer Science

20 pages

Scientific paper

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules working as constraints. We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.

Affiliated with

Also associated with

No associations

Rating

Minimal founded semantics for disjunctive logic programs and deductive databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal founded semantics for disjunctive logic programs and deductive databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal founded semantics for disjunctive logic programs and deductive databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102309