On Computing Solutions to Belief Change Scenarios

Authors:
James P. Delgrande;Torsten Schaub;Hans Tompits;Stefan Woltran
Affiliations:
-;-;-;-
Venue:
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2001

Citing 10
Cited 3

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Relative complexities of first order calculi

Relative complexities of first order calculi
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Resolution for quantified Boolean formulas

Information and Computation
An algorithm to evaluate quantified Boolean formulae

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Consistency-Based Model for Belief Change: Preliminary Report

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Distributed Algorithm to Evaluate Quantified Boolean Formulae

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
Improvements to the evaluation of quantified boolean formulae

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Representing paraconsistent reasoning via quantified propositional logic

Inconsistency Tolerance

Quantified Score

Hi-index	0.00

Visualization

Abstract

Belief change scenarios were recently introduced as a framework for expressing different forms of belief change. In this paper, we show how belief revision and belief contraction (within belief change scenarios) can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specification of belief change within belief change scenarios. Second, this axiomatisation allows us to identify upper bounds for the complexity of revision and contraction within belief change scenarios.We strengthen these upper bounds by providing strict complexity results for the considered reasoning tasks. Finally, we obtain an implementation of different forms. of belief change by appeal to the existing system QUIP.