Sciweavers

74 search results - page 3 / 15
» On the Parameterized Complexity of Default Logic and Autoepi...
Sort
View
ECAI
1998
Springer
13 years 9 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
JOLLI
1998
103views more  JOLLI 1998»
13 years 5 months ago
An Interpretation of Default Logic in Minimal Temporal Epistemic Logic
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
Joeri Engelfriet, Jan Treur
SAT
2009
Springer
121views Hardware» more  SAT 2009»
13 years 12 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
LPNMR
1993
Springer
13 years 9 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...