Results 1  10
of
266,282
Seminormal Stratified Default Theories
"... . In the paper we study seminormal default theories. The notions of stratification and strong stratification are introduced. The properties of stratified and strongly stratified default theories are investigated. We show how to determine if a given seminormal default theory is strongly stratified an ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
. In the paper we study seminormal default theories. The notions of stratification and strong stratification are introduced. The properties of stratified and strongly stratified default theories are investigated. We show how to determine if a given seminormal default theory is strongly stratified
Ordering Default Theories
"... In firstorder logic, a theory T1 is considered stronger than another theory T2 if every formula derived from T2 is also derived from T1. Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default information as well ..."
Abstract
 Add to MetaCart
In firstorder logic, a theory T1 is considered stronger than another theory T2 if every formula derived from T2 is also derived from T1. Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default information
Ordering Default Theories
"... In firstorder logic, a theory T 1 is considered stronger than another theory T 2 if every formula derived from T 2 is also derived from T 1 . Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default informati ..."
Abstract
 Add to MetaCart
In firstorder logic, a theory T 1 is considered stronger than another theory T 2 if every formula derived from T 2 is also derived from T 1 . Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default
Splitting a Default Theory
 In Proc. of AAAI96
, 1996
"... This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by "splitting it into parts." These socalled Splitting Theorems for default logic are related in spirit to "partial evaluation" in logic programming, in ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by "splitting it into parts." These socalled Splitting Theorems for default logic are related in spirit to "partial evaluation" in logic programming
On the Compilation of Possibilistic Default Theories
"... Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper focuses on a possibilistic approach, and more precisely on the MSPentailment from default theories which is equivalent t ..."
Abstract
 Add to MetaCart
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper focuses on a possibilistic approach, and more precisely on the MSPentailment from default theories which is equiva
Reasoning with Stratified Default Theories
, 1995
"... Default logic is one of the principal formalisms for nonmonotonic reasoning. In this paper, we study algorithms for computing extensions for a class of general propositional default theories. We focus on the problem of partitioning a given set of defaults into a family of its subsets. Then we in ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Default logic is one of the principal formalisms for nonmonotonic reasoning. In this paper, we study algorithms for computing extensions for a class of general propositional default theories. We focus on the problem of partitioning a given set of defaults into a family of its subsets. Then we
SemiRepresentability of Default Theories in Rational Default Logic
 In Lecture Notes in Artificial Intelligence 1126
, 1996
"... Marek and Truszczy'nski studied the representability issue for default logic. They proved that an arbitrary default theory can be represented by a weak seminormal default theory provided the language L has been extended by new atoms. We will prove in this paper that their construction preserves ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Marek and Truszczy'nski studied the representability issue for default logic. They proved that an arbitrary default theory can be represented by a weak seminormal default theory provided the language L has been extended by new atoms. We will prove in this paper that their construction
Open Default Theories over Closed
 in Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, A.Hunter and S. Parsons eds
, 1999
"... In this paper we compare two approaches to the meaning of a free variable x in an open default #(x):#1 (x),...,# m (x) . The first treats x as a metavariable for the ground terms of the underlying theory, whereas the second treats it as a "name" of arbitrary elements of the theory unive ..."
Abstract
 Add to MetaCart
In this paper we compare two approaches to the meaning of a free variable x in an open default #(x):#1 (x),...,# m (x) . The first treats x as a metavariable for the ground terms of the underlying theory, whereas the second treats it as a "name" of arbitrary elements of the theory
Relating Disjunctive Logic Programs to Default Theories
 In Proc. LPNMR
, 1993
"... This paper presents the relationship between disjunctive logic programs and default theories. We first show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive lo ..."
Abstract
 Add to MetaCart
This paper presents the relationship between disjunctive logic programs and default theories. We first show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive
Default theory for Well Founded Semantics with Explicit Negation
"... One aim of this paper is to define a default theory for Well Founded Semantics of logic programs which have been extended with explicit negation, such that the models of a program correspond exactly to the extensions of the default theory corresponding to the program. To do so we must introduce a ne ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
One aim of this paper is to define a default theory for Well Founded Semantics of logic programs which have been extended with explicit negation, such that the models of a program correspond exactly to the extensions of the default theory corresponding to the program. To do so we must introduce a
Results 1  10
of
266,282