Logic programs with monotone abstract constraint atoms

Details Logic programs with monotone abstract constraint atoms Logic programs with monotone abstract constraint atoms

2006-08-25

arxiv.org/abs/cs/0608103v1

Computer Science

Artificial Intelligence

33 pages

Scientific paper

We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization involves nondeterminism. Our main results demonstrate that our formalism is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with weight atoms (lparse programs) with the semantics of stable models, as defined by Niemela, Simons and Soininen, and (3) of disjunctive logic programming with the possible-model semantics of Sakama and Inoue.

Affiliated with

Also associated with

No associations

Rating

Logic programs with monotone abstract constraint atoms 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 Logic programs with monotone abstract constraint atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic programs with monotone abstract constraint atoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-111380