DBScholar

Back to papers

The Size of a Revised Knowledge Base

Summary: Analyzes the minimum representation size of propositional knowledge bases after belief revision. Classifies revision formalisms as compactable or non-compactable—sometimes conditional on PH collapse—and shows query-answering complexity alone does not determine compactability. (summarized by gpt-5.6-luna on Jul 21 2026)

Paper ID
1063
Venue
PODS
Year
1995
Pagerank
5.0723324e-05
Overall Rank
13,042 | 10.83%
DOI
10.1145/212433.220205

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{cadoli_pods95,
        address = {New York, NY, USA},
        series = {{PODS} '95},
        title = {{The Size of a Revised Knowledge Base}},
        url = {https://dl.acm.org/doi/10.1145/212433.220205},
        doi = {10.1145/212433.220205},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Cadoli, Marco and Donini, Francesco M. and Liberatore, Paolo and Schaerf, Marco},
        year = {1995}
}

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
607 On the Semantics of Updates in Databases 1983 PODS 0.00015791032
2,518 On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals 1992 PODS 8.4545961e-05
Previous Page 1 / 1 Next

Semantically Similar Papers