期刊名称：Journal of Automation, Mobile Robotics & Intelligent Systems (JAMRIS)
印刷版ISSN：1897-8649
电子版ISSN：2080-2145
出版年度：2006
卷号：27
页码：299-334
出版社：Industrial Research Inst. for Automation and Measurements, Warsaw
摘要：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.
