On Computing Belief Change Operations using Quantified Boolean Formulas

DOI10.1093/LOGCOM/14.6.801zbMATH Open1066.03028OpenAlexW2066173367MaRDI QIDQ4659952FDOQ4659952

Torsten Schaub, Stefan Woltran, James Delgrande, Hans Tompits

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

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

Cited In (10)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)