## On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals (1992)

### Cached

### Download Links

- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- DBLP

### Other Repositories/Bibliography

Venue: | ARTIFICIAL INTELLIGENCE |

Citations: | 186 - 12 self |

### BibTeX

@ARTICLE{Eiter92onthe,

author = {Thomas Eiter and Georg Gottlob},

title = {On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals},

journal = {ARTIFICIAL INTELLIGENCE},

year = {1992},

volume = {57},

pages = {227--270}

}

### Years of Citing Articles

### OpenURL

### Abstract

We study the complexity of several recently proposed methods for updating or revising propositional knowledge bases. In particular, we derive complexity results for the following problem: given a knowledge base T , an update p, and a formula q, decide whether q is derivable from T p, the updated (or revised) knowledge base. This problem amounts to evaluating the counterfactual p > q over T . Besides the general case, also subcases are considered, in particular where T is a conjunction of Horn clauses, or where the size of p is bounded by a constant.