Add to ORKGIn this paper, we extend the progression semantics for first-order disjunctive logic programs and show that it coincides with the stable model semantics. Based on it, we further show how disjunctive answer set programming is related to Satisfiability Modulo Theories
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and n...
We report our research on semantics for normal/disjunctive programs. One of the most well known sema...
AbstractThere are three most prominent semantics defined for certain subclasses of disjunctive logic...
In this paper, we extend the progression semantics for first-order disjunctive logic programs and sh...
In this paper, we propose a progression semantics for first-order normal logic programs, and show th...
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic pro...
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunct...
Abstract. While the stable model semantics, in the form of Answer Set Programming, has become a succ...
Logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by co...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
AbstractDisjunctive logic programs have become a powerful tool in knowledge representation and commo...
AbstractIn this paper, we study the expressive power and recursion-theoretic complexity of disjuncti...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
In this paper, we propose a progression semantics for first-order answer set programs. Based on this...
We show that every propositional disjunctive logic program under the answer set semantics can be equ...
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and n...
We report our research on semantics for normal/disjunctive programs. One of the most well known sema...
AbstractThere are three most prominent semantics defined for certain subclasses of disjunctive logic...
In this paper, we extend the progression semantics for first-order disjunctive logic programs and sh...
In this paper, we propose a progression semantics for first-order normal logic programs, and show th...
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic pro...
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunct...
Abstract. While the stable model semantics, in the form of Answer Set Programming, has become a succ...
Logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by co...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
AbstractDisjunctive logic programs have become a powerful tool in knowledge representation and commo...
AbstractIn this paper, we study the expressive power and recursion-theoretic complexity of disjuncti...
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable...
In this paper, we propose a progression semantics for first-order answer set programs. Based on this...
We show that every propositional disjunctive logic program under the answer set semantics can be equ...
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and n...
We report our research on semantics for normal/disjunctive programs. One of the most well known sema...
AbstractThere are three most prominent semantics defined for certain subclasses of disjunctive logic...