Database Paper Browser

Back to papers

The Size of a Revised Knowledge Base

Summary: Studies, for propositional belief revision, the minimal-size formula equivalent to the revised KB and defines “compactability” (existence of polynomial-space representations). Shows some revision formalisms are compactable while others are provably non-compactable unless the polynomial hierarchy collapses, and links compactability to query-answering complexity beyond mere worst‑case class. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1064
Venue
PODS
Year
1995
Pagerank
4.1945683e-05
Overall Rank
12,795 | 10.99%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
556 On the Semantics of Updates in Databases 1983 PODS 0.00020249905
2,578 On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals 1992 PODS 8.5091045e-05
Previous Page 1 / 1 Next

Semantically Similar Papers