This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Coherence Approach to Logic Program Revision
January/February 1998 (vol. 10 no. 1)
pp. 108-119

Abstract—In this paper, we present a new approach to the problem of revising extended programs; we base this approach on the coherence theory initially advocated by Gardenfors for belief revision. Our approach resolves contradiction by removing only conflicting information, not the believed source of it, and therefore, keeps information loss minimal. Furthermore, since there is no need to search for problematic assumptions, as is done in the traditional assumption-removal approach, our approach provides a skeptical revision semantics that is tractable. We define the skeptical and credulous coherence semantics and show that both semantics can be characterized in terms of the fixpoint semantics of a revised program using a simple program-revision technique. These semantics provide a suitable framework for knowledge and belief revision in the context of logic programs. Semantical properties and advantages of the proposed revision semantics are also analyzed.

[1] J.J. Alferes, P. Dung, and L. Pereira, "Scenario Semantics of Extended Logic Programs," Proc. Second Int'l Workshop Logic Programming and Nonmonotonic Reasoning, MIT Press, 1993.
[2] J.J. Alferes, C.V. Damasio, and L.M. Pereira, "Top-Down Query Evaluation for Well-Founded Semantics with Explicit Negation," Proc. ECAI '94, pp. 140-144, 1994.
[3] J. Dix, "A Framework for Representing and Characterizing Semantics of Logic Programs," Proc. KR '92, pp. 591-602, 1992.
[4] J. Dix, "A Classification Theory of Semantics of Normal Logic Programs: II—Weak Properties, Fundamenta Informaticae, vol. 22, no. 3, pp. 257-288, 1995.
[5] P.M. Dung, "Negations as Hypotheses: An abductive Foundation for Logic Programming," Proc. Eighth Int'l Conf. Logic Programming, pp. 3-17, MIT Press, 1991.
[6] P.M. Dung, "An Argumentation Semantics for Logic Programming with Explicit Negation," Proc. 10th Int'l Conf. Logic Programming, pp. 615-630, MIT Press, 1993.
[7] Belief Revision, P. Gardenfors, ed., Cambridge Univ. Press, 1992.
[8] A. Van Gelder, "The Alternating Fixpoint of Logic Programs with Negation," J. Computer and System Sciences, vol. 47, pp. 185-221, 1993.
[9] M. Gelfond and V. Lifschitz (1990), “Logic Programs with Classical Negation,” Proc. of the 7th Intl. Conf. on Logic Programming, pp. 579-597, MIT Press.
[10] M. Gelfond, and V. Lifschitz, "The stable Model Semantics for Logic Programming," Proc. Fifth Int'l Conf. and Symp. Logic Programming, pp. 1,070-1,080, MIT Press, 1988.
[11] Y. Hu and L.Y. Yuan, "Extended Well Founded Semantics for Logic Programs with Negations," Proc. Eighth Int'l Conf. Logic Programming, pp. 412-425, MIT Press, 1991.
[12] D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, "Uniform Proofs as a Foundation for Logic Programming," Annals Pure and Applied Logic, vol. 51, pp. 125-157, 1991.
[13] L.M. Pereira and J.J. Alferes, "Well-Founded Semantics with Explicit Negation," Proc. 10th ECAI, pp. 102-106, 1992.
[14] L.M. Pereira, J.J. Alferes, and J.N. Aparicio, "Contradiction Removal within Well Founded Semantics," Proc. First Int'l Workshop Logic Programming and Nonmonotonic Reasoning, pp. 106-119, 1991.
[15] T.C. Przymusinski, "The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics," Fundamenta Informaticae, vol. 13, pp. 445-463, 1990.
[16] D. Saccà and C. Zaniolo, "Stable Models and Non-determinism for Logic Programs with Negation," ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 205-217, 1990.
[17] M. Wallace, "Unrestricted Logic Programs, or If Stratification is the Cure, What is the Malady?" Proc. European Conf. AI, pp. 682-687, 1990.
[18] C. Witteveen and G. Brewka, "Skeptical Reason Maintenance and Belief Revision," Artificial Intelligence, vol. 61, pp. 1-36, 1993.
[19] C. Witteveen and C.M. Jonker, "Revision by Expansion in Logic Programs," Report 93-02, Faculty of Mathematics and Computer Science, Delft Univ. of Tech nology, 1993.
[20] J.H. You and L. Yuan, “A Three-Valued Semantics for Deductive Databases and Logic Programs,” J. Computer and System Sciences, vol. 49, pp. 334–361, 1994.
[21] J. You and L.Y. Yuan, "On the Equivalence of Semantics for Normal Logic Programs," J. Logic Programming, vol. 22, no. 3, pp. 209-219, 1995.
[22] J. You, R. Cartwright, and M. Li, "Iterative Belief Revision in Extended Logic Programming," Theoretical Computer Science, vol. 70, nos. 1-2, pp. 383-406, 1996.
[23] J. You and L.Y. Yuan, "Logic Programming with Assumption Denials," Non-Monotonic Extensions of Logic Programming, J. Dix, L.M. Perira, and T.C. Przymusinski, eds., Lecture Notes in Artificial Intelligence, vol. 927, pp. 85-100, 1995.
[24] L.Y. Yuan, "Autoepistemic Logic of First Order and Its Expressive Power," J. Automated Reasoning, vol. 13, pp. 69-82, 1994.
[25] L.Y. Yuan and J. You, "Justification Rules and Justified Model Semantics," Proc. Pacific Rim Int'l Conf. AI, pp. 822-827, 1990.
[26] L.Y. Yuan and J. You, "Autoepistemic Circumscription and Logic Programming," J. Automated Reasoning, vol. 10, pp. 143-160, 1993.

Index Terms:
Logic programming, knowledge representation, nonmonotonic reasoning, belief revision.
Citation:
Li-Yan Yuan, Jia-Huai You, "Coherence Approach to Logic Program Revision," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 1, pp. 108-119, Jan.-Feb. 1998, doi:10.1109/69.667094
Usage of this product signifies your acceptance of the Terms of Use.