AGM contraction is not reconstructible as a descriptor operation

DOI10.1093/LOGCOM/EXV076MaRDI QIDQ3133159zbMATHOpenAlexFDO

Authors Sven Ove Hansson

Publication date 13 February 2018

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exv076

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Recommendations

• Decomposition of multiple AGM contraction: possibility and impossibility results
• Reconstruction of contraction operators
• A Generalisation of AGM Contraction and Revision to Fragments of First-Order Logic
• An undecidability result for AGh
• AGM meets abstract argumentation: contraction for dung frameworks
• The conorm code of an AG-code
• Construction of all non-reducible descriptors
• Factoring out the impossibility of logical aggregation
• Some constructions of aggregation operators
• Aggregation operators based on indistinguishability operators

Cited in

(3)

• Conditional descriptor revision and its modelling by a CSP
• Back to basics: belief revision through direct selection
• Reconstruction of contraction operators

This page was built for publication: AGM contraction is not reconstructible as a descriptor operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133159)