Add to ORKGn this paper, we show that first-order logic programs with monotone aggregates under the stable model semantics can be captured in classical first-order logic. More precisely, we extend the notion of ordered completion for logic programs with a large variety of aggregates so that every stable model of a program with aggregates corresponds to a classical model of its enhanced ordered completion, and vice versa
We study properties of programs with monotone and convex constraints. We extend to these formalisms ...
Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and pri...
Logic programs with aggregates (LPA) are one of the major linguistic extensions to Logic Programming...
Abstract We consider the problem of translating first-order answer set programs with aggregates into...
In this paper, we present a framework for the semantics and the computation of aggregates in the con...
In this paper, we present a framework for the semantics and the computation of aggregates in the con...
In this paper, we propose a translation from normal first-order logic programs under the answer set ...
In this paper, we propose a translation from normal first-order logic programs under the answer set ...
We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbo...
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate ...
AbstractIn this paper, we propose a translation from normal first-order logic programs under the sta...
We define a translation of aggregate programs to normal logic programs which preserves the set of pa...
Logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by co...
In this paper, we propose a progression semantics for first-order normal logic programs, and show th...
Abstract. We investigate the relationship between the generalization of program completion defined i...
We study properties of programs with monotone and convex constraints. We extend to these formalisms ...
Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and pri...
Logic programs with aggregates (LPA) are one of the major linguistic extensions to Logic Programming...
Abstract We consider the problem of translating first-order answer set programs with aggregates into...
In this paper, we present a framework for the semantics and the computation of aggregates in the con...
In this paper, we present a framework for the semantics and the computation of aggregates in the con...
In this paper, we propose a translation from normal first-order logic programs under the answer set ...
In this paper, we propose a translation from normal first-order logic programs under the answer set ...
We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbo...
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate ...
AbstractIn this paper, we propose a translation from normal first-order logic programs under the sta...
We define a translation of aggregate programs to normal logic programs which preserves the set of pa...
Logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by co...
In this paper, we propose a progression semantics for first-order normal logic programs, and show th...
Abstract. We investigate the relationship between the generalization of program completion defined i...
We study properties of programs with monotone and convex constraints. We extend to these formalisms ...
Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and pri...
Logic programs with aggregates (LPA) are one of the major linguistic extensions to Logic Programming...