Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
Making believers out of computers
Artificial Intelligence
Updating logical databases
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence
The size of a revised knowledge base
Artificial Intelligence
Belief revision and update: complexity of model checking
Journal of Computer and System Sciences
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Preprocessing of intractable problems
Information and Computation
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Sometimes updates are circumscription
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A propositional knowledge base can be seen as a compact representation of a set of models. When a knowledge base T is updated with a formula P, the resulting set of models can be represented in two ways: either by a theory T' that is equivalent to T*P or by the pair 〈T,P〉. The second representation can be super-polinomially more compact than the first. In this paper, we prove that the compactness of this representation depends on the specific semantics of *, e.g., Winslett's semantics is more compact than Ginsberg's.