Add to ORKGThe extension, one of the most important notions in Reiter\u27s default logic, is not computable in general. This paper proposes new notions of sub-extension and approximate extension which can successively be constructed from a given default theory. By introducing a time-bound into them, we show that every step of our construction terminates in a finite time. We also prove that the set of approximate extensions contains the set of extensions in Reiter\u27s sense
Abstract. Investigations of default logic have been so far mostly concerned with the notion of an ex...
AbstractWe identify several new tractable subsets and several new intractable simple cases for reaso...
We present a development of the theory of default information structures, combining ideas from domai...
The extension is the most important concept of default logic, but it is not constructible. In [6], w...
AbstractWe introduce an alternative conceptual basis for default reasoning in Reiter's default logic...
AbstractThis paper introduces a generalization of Reiter's notion of “extension” for default logic. ...
In this paper we analyze the problem of checking whether a default theory has a single extension. Th...
Abstract. In this paper we analyze the problem of checking whether a default theory has a single ext...
This paper is concerned with the extension and the belief revision in Reiter\u27s default reasoning....
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of def...
Lecture Notes in Artificial Intelligence 383,27-37, 1989This paper is concerlled with extension and ...
this paper we introduce the class of so called stationary extensions of a default theory. Stationary...
AbstractIn previous papers some important properties of extensions of general default theories were ...
Reiter’s default logic is one of the best known and most studied of the approaches to nonmonotonic r...
We propose a technique for dealing with the high complexity of reasoning under propositional default...
Abstract. Investigations of default logic have been so far mostly concerned with the notion of an ex...
AbstractWe identify several new tractable subsets and several new intractable simple cases for reaso...
We present a development of the theory of default information structures, combining ideas from domai...
The extension is the most important concept of default logic, but it is not constructible. In [6], w...
AbstractWe introduce an alternative conceptual basis for default reasoning in Reiter's default logic...
AbstractThis paper introduces a generalization of Reiter's notion of “extension” for default logic. ...
In this paper we analyze the problem of checking whether a default theory has a single extension. Th...
Abstract. In this paper we analyze the problem of checking whether a default theory has a single ext...
This paper is concerned with the extension and the belief revision in Reiter\u27s default reasoning....
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of def...
Lecture Notes in Artificial Intelligence 383,27-37, 1989This paper is concerlled with extension and ...
this paper we introduce the class of so called stationary extensions of a default theory. Stationary...
AbstractIn previous papers some important properties of extensions of general default theories were ...
Reiter’s default logic is one of the best known and most studied of the approaches to nonmonotonic r...
We propose a technique for dealing with the high complexity of reasoning under propositional default...
Abstract. Investigations of default logic have been so far mostly concerned with the notion of an ex...
AbstractWe identify several new tractable subsets and several new intractable simple cases for reaso...
We present a development of the theory of default information structures, combining ideas from domai...