Properties and Applications of Programs with Monotone and Convex Constraints

09/30/2011
by   L. Liu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/1999

Extremal problems in logic programming and stable model computation

We study the following problem: given a class of logic programs C, deter...
research
05/02/2009

An Application of Proof-Theory in Answer Set Programming

We apply proof-theoretic techniques in answer Set Programming. The main ...
research
09/09/2019

On the Strong Equivalences for LPMLN Programs

LPMLN is a powerful knowledge representation and reasoning tool that com...
research
02/11/2018

New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs

We propose two models of random quantified boolean formulas and their na...
research
07/23/2009

Relativized hyperequivalence of logic programs for modular programming

A recent framework of relativized hyperequivalence of programs offers a ...
research
07/15/2023

Elementary Sets for Logic Programs

By introducing the concepts of a loop and a loop formula, Lin and Zhao s...
research
09/18/2018

On a Convex Logic Fragment for Learning and Reasoning

In this paper we introduce the convex fragment of Łukasiewicz Logic and ...

Please sign up or login with your details

Forgot password? Click here to reset