Description

• Title:
  On algorithmic properties of propositional inconsistency-adaptive logics
• Creator:
  Odintsov, Sergei P.;
  Speranski, Stanislav O.
• Description:
  The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuNr and CLuNm , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
• Object availability:
  free access
• Rights:
  Prawa autorskie (c) 2017 Logic and Logical Philosophy
• Date:
  2012.08.30
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Language:
  English
• Source:
  Logic and Logical Philosophy; Vol. 21 No. 3 (2012): September; 209–228;
  Logic and Logical Philosophy; Tom 21 Nr 3 (2012): September; 209–228;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Publisher:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relation: https://apcz.umk.pl/LLP/article/view/LLP.2012.011/1281
• Subject:
  inconsistency-adaptive logics;
  non-monotonic logic;
  dynamic reasoning;
  reliability strategy;
  minimal abnormality strategy;
  computational complexity;
  expressiveness
• Identifier: https://apcz.umk.pl/LLP/article/view/LLP.2012.011
• Data provider:
  Akademicka Platforma Czasopism
• Can I use it?:
  seek permission
• Type:
  text