Properties and Applications of Programs with Monotone and Convex Constraints

Details Properties and Applications of Programs with Monotone and Convex Constraints Properties and Applications of Programs with Monotone and Convex Constraints

2011-09-30

arxiv.org/abs/1110.0023v1

Journal Of Artificial Intelligence Research, Volume 27, pages 299-334, 2006

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.2009

We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations, tight programs and Fages Lemma, program completion and loop formulas. Our results provide an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of lparse programs. They imply a method to compute stable models of lparse programs by means of off-the-shelf solvers of pseudo-boolean constraints, which is often much faster than the smodels system.

Affiliated with

Also associated with

No associations

Rating

Properties and Applications of Programs with Monotone and Convex Constraints 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 Properties and Applications of Programs with Monotone and Convex Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properties and Applications of Programs with Monotone and Convex Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-236421