Maximal contractions in Boolean algebras

DOI10.1007/S11432-012-4631-6MaRDI QIDQ362282zbMATH OpenOpenAlexFDO

Authors Huixian Shi, Guojun Wang

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

basic elementclauseconsistencydeductive elementmaximal contractionminimal subtraction

Mathematics Subject Classification ID

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

Recommendations

• A general framework for computing maximal contractions
• An algorithm to compute maximal contractions for Horn clauses
• scientific article; zbMATH DE number 4004239
• A representative model based algorithm for maximal contractions
• An algebraic approach to belief contraction and nonmonotonic entailment

Cites work

• An algorithm to compute maximal contractions for Horn clauses
• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• On isomorphisms of integral table algebras.
• On the logic of iterated belief revision
• On the logic of theory change: Partial meet contraction and revision functions
• On the logic of theory change: safe contraction
• Propositional knowledge base revision and minimal change

Cited in

(2)

• On the boolean minimal realization problem in the max-plus algebra
• Maximal contractive tuples

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

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