Constraints, Causal Rules and Minimal Change in Model-based Update
暂无分享,去创建一个
We consider knowledge base update while the domain constraints are explicitly taken into account. We argue that the traditional constraint form is problematic to capture the causality of the domain, and ignoring this point may lead to difficulties in knowledge base updates. To handle this problem properly, it is necessary to describe the causal rules of the domain explicitly in the update formalism. Unlike other researchers viewing causal rules as some kind of inference rules, we distinguish causal rules between defeasible and non-defeasible cases. It turns out that a causality-based update theory in our formalism can be specified as a Reiter's closed default theory while defeasible causal rules correspond to closed normal defaults and non-defeasible causal rules correspond to closed defaults without justification. By using Lukaszewicz's model default theory, we provide a formal semantics for our causal rules. We then propose a causality-based minimal change approach for representing update, and show that our approach provides plausible solutions for model-based updates. We also investigate the properties of our approach and show that our approach generalizes the classical PMA update theory [4] and a recent causality-based update method [2].
[1] Hudson Turner,et al. A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.
[2] Witold Lukaszewicz,et al. Non-monotonic reasoning - formalization of commonsense reasoning , 1990 .
[3] Norman Y. Foo,et al. Updating Knowledge Bases with Disjunctive Information , 1996, AAAI/IAAI, Vol. 1.
[4] Marianne Winslett,et al. Reasoning about Action Using a Possible Models Approach , 1988, AAAI.
[5] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..