Add to ORKGA class of logic programming systems based on Reiter’s default logic is discussed. The first question addressed is how to compute answers when a query is a set of clauses and a program is a set of clauses and defaults. Here, the clauses are not restricted to be Horn clauses and the defaults are a special case of Reiter’s open normal defaults. Then, the problem of computing answers is rediscussed in the context of the concept of typical elements. This new concept of typicality is care-fully defined and given a clean semantics. 1
. The study of different variants of default logic reveales not only differences but also properties...
Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about t...
Reiter’s original proposal for default logic is unsatisfactory for open default theories because of ...
AbstractIn previous papers some important properties of extensions of general default theories were ...
AbstractDefault logic was proposed by Reiter as a knowledge representation tool. In this paper, we p...
AbstractWe identify several new tractable subsets and several new intractable simple cases for reaso...
Abstract. We present a method of representing some classes of default theories as normal logic progr...
Normal forms play an important role in computer science, for example in the areas of logic and datab...
In this paper, we discuss how statements about defaults and various forms of exceptions to them can ...
In this paper, we show that Reiter's default logic in the propositional case can be translated into ...
AbstractWe introduce an alternative conceptual basis for default reasoning in Reiter's default logic...
Default reasoning is computationally expensive. One of the most promising ways of easing this proble...
In this paper, we investigate the proof theory of default reasoning. We generalize Reiter's fra...
We present a general proof theoretical methodology for default systems. Given a default theory D#...
In this paper performance of a lately proposed decision procedure for Reiter's default logic is...
. The study of different variants of default logic reveales not only differences but also properties...
Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about t...
Reiter’s original proposal for default logic is unsatisfactory for open default theories because of ...
AbstractIn previous papers some important properties of extensions of general default theories were ...
AbstractDefault logic was proposed by Reiter as a knowledge representation tool. In this paper, we p...
AbstractWe identify several new tractable subsets and several new intractable simple cases for reaso...
Abstract. We present a method of representing some classes of default theories as normal logic progr...
Normal forms play an important role in computer science, for example in the areas of logic and datab...
In this paper, we discuss how statements about defaults and various forms of exceptions to them can ...
In this paper, we show that Reiter's default logic in the propositional case can be translated into ...
AbstractWe introduce an alternative conceptual basis for default reasoning in Reiter's default logic...
Default reasoning is computationally expensive. One of the most promising ways of easing this proble...
In this paper, we investigate the proof theory of default reasoning. We generalize Reiter's fra...
We present a general proof theoretical methodology for default systems. Given a default theory D#...
In this paper performance of a lately proposed decision procedure for Reiter's default logic is...
. The study of different variants of default logic reveales not only differences but also properties...
Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about t...
Reiter’s original proposal for default logic is unsatisfactory for open default theories because of ...