Results 1  10
of
259
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
Tableau Proofs for Skeptical Reasoning
, 1999
"... . We present a monotone inductive characterization of the set of skeptical consequences of a nonmonotonic rule system. Nonmonotonic rule systems are an abstraction of the nonmonotonic properties of many systems designed to formalize everyday reasoning, including default logic, autoepistemic logi ..."
Abstract
 Add to MetaCart
logic, and logic programming. We begin with preliminary results about nonmonotonic rule systems. The main result is the soundess and completeness of a tableau proof system (using countably branching tableaux) for skeptical consequence. 1 Introduction From the rst proposals for dening nonmonotonic
Epistemic Reasoning in Logic Programs
"... Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents ' epistemic behaviours, it embeds a signicantly higher computational complexity than nondisjunctive and disjunctive answer set programming. In this paper, we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
logic programs. Based on these discoveries, we identify two nontrivial classes of epistemic logic programs whose consistency checking complexity is reduced from PSPACEcomplete to NPcomplete and P2complete respectively. We observe that many important applications on epistemic representation fall
A Sequent Calculus for Skeptical Default Logic
 Proc. of the Int. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, SpringerVerlag LNCS 1227
, 1997
"... . In this paper, we contribute to the prooftheory of Reiter's Default Logic by introducing a sequent calculus for skeptical reasoning. The main features of this calculus are simplicity and regularity, and the fact that proofs can be surprisingly concise and, in many cases, involve only a s ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
. In this paper, we contribute to the prooftheory of Reiter's Default Logic by introducing a sequent calculus for skeptical reasoning. The main features of this calculus are simplicity and regularity, and the fact that proofs can be surprisingly concise and, in many cases, involve only a
Temporal Reasoning with Abductive Logic Programming
 Proc. of ECAI'96
, 1996
"... In this paper we extend Gelfond and Lifschitz' action description language A with concurrent actions and give a new semantics to concurrent actions. In order to automate temporal reasoing we present a translation from domain descriptions in the resulting new action description language to abduc ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
to abductive logic programs. The translation has been shown to be both sound and complete. Our method is applicable to the temporal projection problem with incomplete information, as well as to reasoning about the past. 1 INTRODUCTION In [11] Gelfond and Lifschitz proposed an action description language A
THE COMPLEXITY OF REASONING FOR FRAGMENTS OF DEFAULT LOGIC
, 2008
"... Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σ p 2complete, and the complexity of the credulous and skeptical reasoning problem as Σ p 2complete, resp. Πp2complete. Additionally, ..."
Abstract

Cited by 10 (10 self)
 Add to MetaCart
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σ p 2complete, and the complexity of the credulous and skeptical reasoning problem as Σ p 2complete, resp. Πp2complete. Additionally
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
"... Abstract. We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite represen ..."
Abstract
 Add to MetaCart
representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest
Embedding defeasible logic into logic programs
, 2002
"... Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been esta ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a metaprogram P(D). We show that under a condition of decisiveness
Propositional Defeasible Logic has Linear Complexity
 of Logic Programming
, 2001
"... Defeasible logic is a rulebased nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, i ..."
Abstract

Cited by 82 (6 self)
 Add to MetaCart
and propositional circumscription. The complexity of sceptical inference from logic programs with negationasfailure varies according to the semantics of negation. For both the stable model semantics and the Clark completion, sceptical inference is coNPhard. See [13, 9] for more details. Although such languages
Disjunctive Logic Programming and Autoepistemic Logic
, 1998
"... . In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two dierent types of negative introspection in autoepistemic reasoning present two dierent interpretations of default negation: cons ..."
Abstract
 Add to MetaCart
. In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two dierent types of negative introspection in autoepistemic reasoning present two dierent interpretations of default negation
Results 1  10
of
259