Theory Revision; Non-monotonic Logic; Completeness Proofs
Abstract :
[en] Booth and his co-authors have shown in [2], that many new approaches to
theory revision (with fixed K) can be represented by two relations, < and, where < is
the usual ranked relation, and is a sub-relation of <.
They have, however, left open a characterization of the infinite case, which we treat here.
Disciplines :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2011-047
Author, co-author :
Gabbay, Dov M. ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) ; King’s College London, Department of Computer Science, London, UK ; Bar-Ilan University, Ramat-Gan, Israel
