Sciweavers

Share
RR
2010
Springer
8 years 8 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
FUIN
2006
145views more  FUIN 2006»
8 years 10 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
AAAI
2006
8 years 11 months ago
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
Several forms of reasoning in AI
Georg Gottlob, Reinhard Pichler, Fang Wei
AAAI
2006
8 years 11 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
LANMR
2007
8 years 11 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...
NMELP
1994
9 years 2 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
LPNMR
2001
Springer
9 years 2 months ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
LPNMR
2001
Springer
9 years 2 months ago
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
Thomas Lukasiewicz
ICLP
2003
Springer
9 years 3 months ago
Loop Formulas for Disjunctive Logic Programs
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
Joohyung Lee, Vladimir Lifschitz
ASP
2003
Springer
9 years 3 months ago
A Java Wrapper for DLV
Abstract. Disjunctive logic programs are a powerful tool in knowledge representation and commonsense reasoning. The recent development of an efficient disjunctive logic programmin...
Francesco Ricca
books