On Computing Belief Change Operations using Quantified Boolean Formulas

DOI10.1093/LOGCOM/14.6.801MaRDI QIDQ4659952zbMATH OpenOpenAlexFDO

Authors James Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran

Publication date 21 March 2005

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

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

zbMATH Keywords

belief changequantified Boolean formulas

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1844493
• A consistency-based approach for belief change
• An approximate approach to belief revision
• Implementation of belief change operators using BDDs
• The complexity of belief update

Cited in

(10)

• Implementation of belief change operators using BDDs
• On operations of possibilistic belief structures
• A general framework for computing maximal contractions
• An algebraic approach to revising propositional rule-based knowledge bases
• A QBF-based formalization of abstract argumentation semantics
• Computational methods for database repair by signed formulae
• Belief Base Change Operations for Answer Set Programming
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• COBA 2.0: A Consistency-Based Belief Change System
• scientific article; zbMATH DE number 1844493 (Why is no real title available?)

This page was built for publication: On Computing Belief Change Operations using Quantified Boolean Formulas

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