AbstractStable generated models for extended generalized logic programs with two kinds of negation provide a semantics for logic programming in its (up to now) most general form. We show that stable generated semantics for extended logic programs coincides with the semantics obtained by translating programs into a minimal partial temporal logic. Then we introduce several new versions of (disjunctive) default logic and show that there are strong (semantical) connections between default logic and logic programming with stable generated models
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
Abstract. We propose a paraconsistent declarative semantics of pos-sibly inconsistent generalized lo...
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic pro...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
Abstract. The interest in extensions of the logic programming paradigm beyond the class of normal lo...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
We report our research on semantics for normal/disjunctive programs. One of the most well known sema...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
Logic programs are an important knowledge representation tool. In many cases, definite logic program...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunct...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
Abstract. We propose a paraconsistent declarative semantics of pos-sibly inconsistent generalized lo...
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic pro...
AbstractStable generated models for extended generalized logic programs with two kinds of negation p...
We present a general definition of stable models for generalized logic programs which a: subsumes th...
Abstract. The interest in extensions of the logic programming paradigm beyond the class of normal lo...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
We report our research on semantics for normal/disjunctive programs. One of the most well known sema...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
Logic programs are an important knowledge representation tool. In many cases, definite logic program...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunct...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
Abstract. We propose a paraconsistent declarative semantics of pos-sibly inconsistent generalized lo...
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic pro...