Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Incremental recompilation of knowledge (extended abstract)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
The complexity of nested counterfactuals and iterated knowledge base revisions
Journal of Computer and System Sciences
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
Semantical and computational aspects of Horn approximations
Artificial Intelligence
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Belief revision and update: complexity of model checking
Journal of Computer and System Sciences
A unified framework for structure identification
Information Processing Letters
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Horn complements: towards horn-to-horn belief revision
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Consistent query answers in the presence of universal constraints
Information Systems
Constraints, consistency and closure
Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
A preference-based framework for updating logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Approximate knowledge compilation: the first order case
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
On applying the AGM theory to DLs and OWL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Transitively relational partial meet horn contraction
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Database Repairing and Consistent Query Answering
Database Repairing and Consistent Query Answering
Prime implicates and relevant belief revision
Journal of Logic and Computation
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Belief revision has been extensively studied in the framework of propositional logic, but just recently revision within fragments of propositional logic has gained attention. Hereby it is not only the belief set and the revision formula which are given within a certain language fragment, but also the result of the revision has to be located in the same fragment. So far, research in this direction has been mainly devoted to the Horn fragment of classical logic. Here we present a general approach to define new revision operators derived from known operators, such that the result of the revision remains in the fragment under consideration. Our approach is not limited to the Horn case but applicable to any fragment of propositional logic where the models of the formulas are closed under a Boolean function. Thus we are able to uniformly treat cases as dual Horn, Krom and affine formulas, as well.