DOIAbstract
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, namely partial stable models of Saccá and Zaniolo and preferred extensions of Phan Minh Dung coincide
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, namely partial stable models of Saccá and Zaniolo and preferred extensions of Phan Minh Dung coincide
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
Abstract. Dung established the connections between several logic pro-gramming semantics and various ...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
We show that two recently presented proposals for the semantics of normal logic programs, namely par...
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, na...
Despite the frequent comment that there is no general agreement on the semantics of logic programs, ...
AbstractDespite the frequent comment that there is no general agreement on the semantics of logic pr...
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), important on i...
AbstractWe show that the framework for unfold/fold transformation of logic programs, first proposed ...
Abstract. The interest in extensions of the logic programming paradigm beyond the class of normal lo...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
AbstractOver the years, the stable-model semantics has gained a position of the correct (two-valued)...
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate ...
For a general logic program, a set of n + 1 logic values is considered and an undened value denoted ...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
Abstract. Dung established the connections between several logic pro-gramming semantics and various ...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
We show that two recently presented proposals for the semantics of normal logic programs, namely par...
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, na...
Despite the frequent comment that there is no general agreement on the semantics of logic programs, ...
AbstractDespite the frequent comment that there is no general agreement on the semantics of logic pr...
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), important on i...
AbstractWe show that the framework for unfold/fold transformation of logic programs, first proposed ...
Abstract. The interest in extensions of the logic programming paradigm beyond the class of normal lo...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
AbstractOver the years, the stable-model semantics has gained a position of the correct (two-valued)...
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate ...
For a general logic program, a set of n + 1 logic values is considered and an undened value denoted ...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
Abstract. Dung established the connections between several logic pro-gramming semantics and various ...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
Add to ORKG