Title of article :
Yet some more complexity results for default logic Original Research Article
Author/Authors :
Rachel Ben-Eliyahu-Zohary، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
20
From page :
1
To page :
20
Abstract :
We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiterʹs default logic. The majority of our findings are related to brave reasoning. By making some intuitive observations, most classes that we identify can be derived quite easily from some subsets of default logic already known in the literature. Some of the subsets we discuss are subclasses of the so-called “extended logic programs”. All the tractable subsets presented in this paper can be recognized in linear time.
Keywords :
Default logic , Complexity classes , Nonmonotonic reasoning
Journal title :
Artificial Intelligence
Serial Year :
2002
Journal title :
Artificial Intelligence
Record number :
1207144
Link To Document :
بازگشت