Apr 30, 2009 · Abstract: This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties.

Jun 16, 2009 · This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties.

This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract ...

Apr 30, 2009 · This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties.

This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract ...

... Logic Programming 1 Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms ... Arbitrary Abstract Constraint Atoms.

Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. Theory and Practice of Logic Programming, 9(4):529. 564, 2009 ...

Abstract. In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms ...

It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by ...

Abstract. We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional sat- isfaction.