Abstract. The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the ‘intended ’ partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary gener-ated models coincid...
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, na...
AbstractThis paper proposes a framework for unfold⧸fold transformation of general logic programs. Th...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
Logic programs are an important knowledge representation tool. In many cases, definite logic program...
AbstractWe propose a general preference criterion selecting the “intended” models of generalized log...
AbstractSemantics for positive programs have been thoroughly explored in the context of Herbrand mod...
Abstract. We propose a paraconsistent declarative semantics of pos-sibly inconsistent generalized lo...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
AbstractDespite the frequent comment that there is no general agreement on the semantics of logic pr...
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic pro...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
In the last years computational logic, and particularly non-monotonic reasoning, was introduced as a...
Despite the frequent comment that there is no general agreement on the semantics of logic programs, ...
We show that two recently presented proposals for the semantics of normal logic programs, namely par...
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, na...
AbstractThis paper proposes a framework for unfold⧸fold transformation of general logic programs. Th...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
Logic programs are an important knowledge representation tool. In many cases, definite logic program...
AbstractWe propose a general preference criterion selecting the “intended” models of generalized log...
AbstractSemantics for positive programs have been thoroughly explored in the context of Herbrand mod...
Abstract. We propose a paraconsistent declarative semantics of pos-sibly inconsistent generalized lo...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
AbstractDespite the frequent comment that there is no general agreement on the semantics of logic pr...
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic pro...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
In the last years computational logic, and particularly non-monotonic reasoning, was introduced as a...
Despite the frequent comment that there is no general agreement on the semantics of logic programs, ...
We show that two recently presented proposals for the semantics of normal logic programs, namely par...
In this paper we reexamine the place and role of stable model semantics in logic programming and con...
AbstractWe show that two recently presented proposals for the semantics of normal logic programs, na...
AbstractThis paper proposes a framework for unfold⧸fold transformation of general logic programs. Th...