Properties of Programs with Monotone and Convex Constraints

Lengning Liu, Miroslaw Truszczynski

We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include tight programs and Fages Lemma, program completion and loop formulas, and the notions of strong and uniform equivalence with their characterizations. Our results form an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of smodels.

Content Area: 11. Logic Programming

Subjects: 11. Knowledge Representation; 3.3 Nonmonotonic Reasoning

Submitted: May 10, 2005

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.