The Complexity of Revision
In this paper we show that the Gupta-Belnap systems and are . Since Kremer has independently established that they are -hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1040609294
Mathematical Reviews number (MathSciNet): MR1271698
Digital Object Identifier: doi:10.1305/ndjfl/1040609294
Zentralblatt MATH identifier: 0801.03021