We address the problem of finding a "tight" representation of complex logical constraints in a mixed integer programming model by describing a convex hull representation of cardinality rules
We study properties of programs with monotone and con-vex constraints. We extend to these formalisms...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
We address the problem of finding a "tight" representation of complex logical constraints ...
Abstract: "We address the problem of finding a 'tight' representation of Horn cardinality rules in a...
AbstractWe define the concept of a representation of a set of either linear constraints in bounded i...
In a logic program the feasible argument sizes of derivable facts involving an n-ary predicate are v...
We study properties of programs with monotone and convex constraints. We extend to these formalisms ...
This paper provides a theoretical insight for the integration of logical constraints into a learning...
AbstractThis paper is concerned with the generation of tight equivalent representations for mixed-in...
Research in logic programming shows an increasing interest in studying tight logic programs because ...
This paper provides a theoretical insight for the integration of logical constraints into a learning...
In this thesis, we examine optimization problems with a constraint that allows for only a certain nu...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
International audienceWe propose a new relational abstract domain for analysing programs with numeri...
We study properties of programs with monotone and con-vex constraints. We extend to these formalisms...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
We address the problem of finding a "tight" representation of complex logical constraints ...
Abstract: "We address the problem of finding a 'tight' representation of Horn cardinality rules in a...
AbstractWe define the concept of a representation of a set of either linear constraints in bounded i...
In a logic program the feasible argument sizes of derivable facts involving an n-ary predicate are v...
We study properties of programs with monotone and convex constraints. We extend to these formalisms ...
This paper provides a theoretical insight for the integration of logical constraints into a learning...
AbstractThis paper is concerned with the generation of tight equivalent representations for mixed-in...
Research in logic programming shows an increasing interest in studying tight logic programs because ...
This paper provides a theoretical insight for the integration of logical constraints into a learning...
In this thesis, we examine optimization problems with a constraint that allows for only a certain nu...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
International audienceWe propose a new relational abstract domain for analysing programs with numeri...
We study properties of programs with monotone and con-vex constraints. We extend to these formalisms...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
DOI
Add to ORKG