A general framework for computing maximal contractions

DOI10.1007/S11704-012-2044-8zbMath1425.68396OpenAlexW2116493788MaRDI QIDQ2418637

Jie Luo

Publication date: 28 May 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-012-2044-8

zbMATH Keywords

algorithmscomputabilitymaximal contractionminimal inconsistent subset

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30)

Related Items (1)

A decomposition based algorithm for maximal contractions

Cites Work

• Unnamed Item
• \textbf{R}-calculus without the cut rule
• An algorithm to compute maximal contractions for Horn clauses
• A consistency-based approach for belief change
• A development calculus for specifications
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• On the logic of theory change: Partial meet contraction and revision functions
• On Computing Belief Change Operations using Quantified Boolean Formulas
• Logical verification of scientific discovery
• Mathematical logic. Foundations for information science

This page was built for publication: A general framework for computing maximal contractions