Computing only minimal answers in disjunctive deductive databases

Details Computing only minimal answers in disjunctive deductive databases Computing only minimal answers in disjunctive deductive databases

2003-05-13

arxiv.org/abs/cs/0305007v1

Computer Science

Logic in Computer Science

48 pages

Scientific paper

A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), whence no non-minimal answer is generated. For stratified databases, the method does not (necessarily) require the computation of models of the database in their entirety. Compilation is proposed as a tool by which problems relating to computational efficiency and the non-existence of disjunctive stable models can be overcome. The extension of our method to other semantics is also considered.

Affiliated with

Also associated with

No associations

Rating

Computing only minimal answers in disjunctive 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 Computing only minimal answers in disjunctive deductive databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing only minimal answers in disjunctive deductive databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-91227