On Properties of Update Sequences Based on Causal Rejection
<|reference_start|>On Properties of Update Sequences Based on Causal Rejection: We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. New information is incorporated into the current knowledge base subject to a causal rejection principle enforcing that, in case of conflicts, more recent rules are preferred and older rules are overridden. Such a rejection principle is also exploited in other approaches to update logic programs, e.g., in dynamic logic programming by Alferes et al. We give a thorough analysis of properties of our approach, to get a better understanding of the causal rejection principle. We review postulates for update and revision operators from the area of theory change and nonmonotonic reasoning, and some new properties are considered as well. We then consider refinements of our semantics which incorporate a notion of minimality of change. As well, we investigate the relationship to other approaches, showing that our approach is semantically equivalent to inheritance programs by Buccafurri et al. and that it coincides with certain classes of dynamic logic programs, for which we provide characterizations in terms of graph conditions. Therefore, most of our results about properties of causal rejection principle apply to these approaches as well. Finally, we deal with computational complexity of our approach, and outline how the update semantics and its refinements can be implemented on top of existing logic programming engines.<|reference_end|>
@article{eiter2001on,
    title={On Properties of Update Sequences Based on Causal Rejection},
    author={T. Eiter, M. Fink, G. Sabbatini and H. Tompits},
    journal={arXiv preprint arXiv:cs/0109006},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0109006},
    primaryClass={cs.AI}
}