Maximal contractions in Boolean algebras

DOI10.1007/S11432-012-4631-6zbMath1270.03134OpenAlexW2050402208MaRDI QIDQ362282

Huixian Shi, Wang, Guojun

Publication date: 20 August 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-012-4631-6

zbMATH Keywords

consistencybasic elementclausedeductive elementmaximal contractionminimal subtraction

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logical aspects of Boolean algebras (03G05)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm to compute maximal contractions for Horn clauses
• On the logic of theory change: safe contraction
• Propositional knowledge base revision and minimal change
• On the logic of iterated belief revision
• On isomorphisms of integral table algebras.
• On the logic of theory change: Partial meet contraction and revision functions

This page was built for publication: Maximal contractions in Boolean algebras