An algorithm to compute maximal contractions for Horn clauses

DOI10.1007/S11432-010-4172-9zbMath1229.03015OpenAlexW2031621466MaRDI QIDQ543196

Jie Luo, Wei Li

Publication date: 17 June 2011

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

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4172-9

zbMATH Keywords

belief revisionmaximal contractionminimal subtractionHorn clauseminimal inconsistent set

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Mechanization of proofs and logical operations (03B35)

Related Items (5)

Logical verification of scientific discovery ⋮ Maximal contractions in Boolean algebras ⋮ A general framework for computing maximal contractions ⋮ A decomposition based algorithm for maximal contractions ⋮ Decidable subsets of open logic and an algorithm for R-calculus

Cites Work

• On the logic of theory change: Partial meet contraction and revision functions
• Mathematical logic. Foundations for information science
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm to compute maximal contractions for Horn clauses