Belief Base Revision of Horn Logic Programs Based on State Transition Diagrams

摘要

We characterize belief base revision of Horn logic programs. The purpose of our characterization is to connect syntactic minimal change of Horn logic programs and semantic minimal change of the least Herbrand models. We define state transition diagrams that connects syntactic constraint of Horn logic programs and semantic constraint of the least Herbrand model of the resulted Horn logic programs for belief base revision. Using the state transition diagram, we provide algorithms of base revision and contraction which perform minimal changes in both syntactic and semantic framework.