The present paper is devoted to computational aspects of propo- sitional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of deriv- ability in such logics, namely in cases of CLuNrand CLuNm, i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.