The complexity of model checking for propositional default logics

被引：0
|
作者：
Liberatore, P [1 ]
Schaerf, M [1 ]
机构：
[1] Univ Roma La Sapienza, Dipartimento Informat & Sistemist, I-00198 Rome, Italy
来源：
ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 1998年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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 Sigma(2)(p) complete, while it is coNP complete under some restrictions on the form of the defaults.
引用
收藏
页码：18 / 22
页数：5
相关论文
共 50 条
  • [1] The complexity of model checking for propositional default logics
    Liberatore, P
    Schaerf, M
    [J]. DATA & KNOWLEDGE ENGINEERING, 2005, 55 (02) : 189 - 202
  • [2] Propositional default logics made easier: computational complexity of model checking
    Baumgartner, R
    Gottlob, G
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 591 - 627
  • [3] On the complexity of model checking for propositional default logics: New results and tractable cases
    Baumgartner, R
    Gottlob, G
    [J]. IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 64 - 69
  • [4] Model checking and validity in propositional and modal inclusion logics
    Hella, Lauri
    Kuusisto, Antti
    Meier, Arne
    Virtema, Jonni
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2019, 29 (05) : 605 - 630
  • [5] Infinite state model-checking of propositional dynamic logics
    Goeller, Stefan
    Lohrey, Markus
    [J]. COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2006, 4207 : 349 - 364
  • [6] Model checking for nonmonotonic logics: algorithms and complexity
    Rosati, R
    [J]. IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 76 - 81
  • [7] Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
    Axelsson, Roland
    Lange, Martin
    [J]. REACHABILITY PROBLEMS, 2011, 6945 : 45 - +
  • [8] Complexity of prioritized default logics
    Rintanen, J
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1998, 9 : 423 - 461
  • [9] On the complexity of entailment in propositional multivalued logics
    [J]. Ann Math Artif Intell, 1 (29):
  • [10] Complexity of Propositional Logics in Team Semantic
    Hannula, Miika
    Kontinen, Juha
    Virtema, Jonni
    Vollmer, Heribert
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2018, 19 (01)
12345