Logic programs with monotone cardinality atoms

Details Logic programs with monotone cardinality atoms Logic programs with monotone cardinality atoms

2003-10-31

arxiv.org/abs/cs/0310063v1

Computer Science

Logic in Computer Science

Proceedings of LPNMR-03 (7th International Conference), LNCS, Springer Verlag

Scientific paper

We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of propositional atoms. We develop a theory of mca-programs. We demonstrate that the operational concept of the one-step provability operator generalizes to mca-programs, but the generalization involves nondeterminism. Our main results show that the formalism of mca-programs is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with cardinality atoms and 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 cardinality 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 cardinality atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic programs with monotone cardinality atoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635211