On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals
Summary: Classifies complexity of deciding whether q follows from T ◦ p for many propositional revision/update operators (Cross-Product, WIDTIO, Dalal, Forbus, Borgida, Winslett, Satoh, Weber), in general and for Horn T or |p|-bounded cases. Assesses adherence to Minimality of Change and pinpoints exact complexity thresholds and tractable fragments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Thomas Eiter (Vienna University of Technology)
- 2. Georg Gottlob (Vienna University of Technology)
BibTeX Citation
@inproceedings{eiter_pods92,
address = {New York, NY, USA},
series = {{PODS} '92},
title = {{On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals}},
url = {https://dl.acm.org/doi/10.1145/137097.137886},
doi = {10.1145/137097.137886},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Eiter, Thomas and Gottlob, Georg},
year = {1992}
}
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS | 0.00013481551 |
| 4,432 | Data Exchange beyond Complete Data | 2011 | PODS | 6.7087209e-05 |
| 12,989 | The Size of a Revised Knowledge Base | 1995 | PODS | 5.093636e-05 |
| 13,024 | Object Migration | 1994 | PODS | 5.093636e-05 |
| 13,042 | Cumulative Updates | 1994 | VLDB | 5.093636e-05 |
| 13,048 | On the Semantics of Theory Change: Arbitration between Old and New Information | 1993 | PODS | 5.093636e-05 |
| 13,082 | Knowledgebase Transformations | 1992 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 602 | On the Semantics of Updates in Databases | 1983 | PODS | 0.00015856828 |
| 5,594 | Hypothetical Datalog: Negation and Linear Recursion | 1989 | PODS | 6.1548494e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,063 | Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases | 1993 | VLDB |
| 2 | 8,084 | Symmetric Weighted First-Order Model Counting | 2015 | PODS |
| 3 | 14,368 | The Complexity of Reusing and Modifying Rulebases | 1992 | PODS |
| 4 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 5 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 6 | 13,149 | A Framework for Comparison of Update Semantics (Extended Abstract) | 1988 | PODS |
| 7 | 13,082 | Knowledgebase Transformations | 1992 | PODS |
| 8 | 13,956 | Knowledge compilation = Query rewriting + View synthesis | 2002 | PODS |
| 9 | 7,563 | Complexity Aspects of Various Semantics for Disjunctive Databases | 1993 | PODS |
| 10 | 12,989 | The Size of a Revised Knowledge Base | 1995 | PODS |