2490 search results - page 18 / 498 » Complexity of Contextual Reasoning |
AAAI
1990
14 years 11 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
DLOG
2003
14 years 11 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
ARGMAS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...