by
Abtg Wissensbasierte Systeme
,
Stefan Woltran
,
James P. Delgrande
,
James P. Delgrande
,
Torsten Schaub
,
Torsten Schaub
,
Hans Tompits
,
Hans Tompits
Add To MetaCart
Abstract:
Belief change scenarios have been introduced as a framework for expressing different forms of belief change. The essential idea is that for a belief change scenario (K; R; C) the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with, the result. By restricting the form of a belief change scenario one obtains specific belief change operators including belief revision, contraction, update, and merging. In this paper, we show how the belief revision and belief contraction operators can be axiomatised by means of quantified Boolean formulas. Basically for both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, in this paper we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This alternative characterisation then leads to further insight into the belief change framework. Second, this axiomatisation allows us to identify strict complexity bounds for the considered reasoning tasks. Finally, we obtain an implementation of different forms of belief change by appeal to existing solvers for quantified Boolean formulas.
Citations
|
1610
|
Computational Complexity
– Papadimitriou
- 1994
|
|
679
|
A theory of diagnosis from first principles
– Reiter
- 1987
|
|
461
|
On the logic of theory change: Partial meet contraction and revision functions
– Alchourrón, Gärdenfors, et al.
- 1985
|
|
458
|
Knowledge in flux: Modeling the dynamics of epistemic states
– Gärdenfors
- 1988
|
|
364
|
An assumption-based tms
– Kleer
- 1986
|
|
330
|
A Logical Framework for Default Reasoning
– Poole
- 1988
|
|
308
|
Planning as satisfiability
– Kautz, Selman
- 1992
|
|
303
|
On the difference between updating a knowledge base and revising it
– Katsuno, Mendelzon
- 1991
|
|
233
|
Reasoning about action using a possible models approach
– Winslett
- 1988
|
|
215
|
The polynomial-time hierarchy
– Stockmeyer
- 1976
|
|
188
|
Investigations into a theory of knowledge base revision
– Dalal
- 1988
|
|
128
|
On the complexity of propositional knowledge base revision, updates and counterfactuals
– Eiter, Gottlob
- 1992
|
|
108
|
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
– Cadoli, Schaerf, et al.
|
|
108
|
Constructing Conditional Plans by a Theorem Prover
– RINTANEN
- 1999
|
|
87
|
Language features for flexible handling of exceptions in Information Systems
– Borgida
- 1984
|
|
66
|
Complete sets and the polynomial-time hierarchy, Theoret. Comput. Sci. 3
– Wrathall
- 1976
|
|
65
|
Introducing actions into qualitative simulation
– Forbus
- 1989
|
|
63
|
Improvements to the evaluation of quantified boolean formulae
– Rintanen
- 1999
|
|
53
|
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
– EGLY, EITER, et al.
|
|
53
|
A.: Resolution for quantified boolean formulas
– Büning, Karpinski, et al.
- 1995
|
|
43
|
QUBE: A system for deciding quantified boolean formulas satisfiability
– Giunchiglia, Narizzano, et al.
- 2001
|
|
43
|
Nonmonotonic reasoning by minimal belief revision
– Satoh
- 1988
|
|
42
|
Iterated theory base change: A computational model
– Williams
- 1995
|
|
41
|
A distributed algorithm to evaluate quantified boolean formulae
– Feldmann, Monien, et al.
- 2000
|
|
41
|
Encodings for equilibrium logic and logic programs with nested expressions
– Pearce, Tompits, et al.
- 2001
|
|
36
|
Updating propositional formulas
– Weber
- 1986
|
|
35
|
How to Give it up: A Survey of Some Formal Aspects of the Logic of Theory Change
– Makinson
- 1985
|
|
33
|
Syntax based approaches to belief revision
– Nebel
- 1992
|
|
25
|
A Structure Preserving Clause Form Translation
– PLAISTED, S
- 1986
|
|
18
|
Reducing belief revision to circumscription (and vice versa
– Liberatore, Schaerf
- 1997
|
|
18
|
An algorithm for belief revision
– Wassermann
- 2000
|
|
15
|
Relative Complexities of First-Order Calculi
– EDER
- 1992
|
|
14
|
Advances in Decision Procedures for Quantified Boolean Formulas
– Letz
- 2001
|
|
9
|
A computational model for belief change and fusing ordered belief bases
– Benferhat, Dubois, et al.
- 2001
|
|
9
|
On the semantics of updates in databases. preliminary report
– Fagin, Ullman, et al.
- 1983
|
|
5
|
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results
– Egly, Eiter, et al.
- 2001
|
|
4
|
A consistency-based model for belief change: Preliminary report
– Delgrande, Schaub
- 2000
|
|
2
|
On Mechanizing Modal Nonmonotonic Logics
– Egly, Eiter, et al.
- 2001
|
|
1
|
A Consistency-Based Paradigm for Belief Change
– Delgrande, Schaub
|
