Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ECAI
1998
Springer

favoriteEmaildiscussreport

121views Artificial Intelligence» more ECAI 1998»

The Complexity of Model Checking for Propositional Default Logics

13 years 8 months ago

The Complexity of Model Checking for Propositional Default Logics

Download www.dis.uniroma1.it

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 interpretation is a model of a default theory for some of the variants of default logic presented in the literature. We prove that all the analyzed variants have the same complexity and that this problem is in general p 2 complete, while it is coNP complete under some restrictions on the form of the defaults.

Paolo Liberatore, Marco Schaerf

Real-time Traffic

Artificial Intelligence | Commonsense Reasoning | Default Logic | Default Theory | ECAI 1998 |

claim paper

Related Content

» Its Not My Default The Complexity of Membership Problems in Restricted Propositional Defau...

» Model checking propositional dynamic logic with all extras

» The Complexity of Reasoning for Fragments of Default Logic

» Proof Complexity of Propositional Default Logic

» Infinite State ModelChecking of Propositional Dynamic Logics

» Shallow Models for Noniterative Modal Logics

» From Answer Set Logic Programming to Circumscription via Logic of GK

» The Complexity of the Warranted Formula Problem in Propositional Argumentation

» Power Defaults

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ECAI
Authors	Paolo Liberatore, Marco Schaerf

Comments (0)