
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
LiYan Yuan, JiaHuai You, "Coherence Approach to Logic Program Revision," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 1, pp. 108119, January/February, 1998.  
BibTex  x  
@article{ 10.1109/69.667094, author = {LiYan Yuan and JiaHuai You}, title = {Coherence Approach to Logic Program Revision}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {10}, number = {1}, issn = {10414347}, year = {1998}, pages = {108119}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.667094}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Coherence Approach to Logic Program Revision IS  1 SN  10414347 SP108 EP119 EPD  108119 A1  LiYan Yuan, A1  JiaHuai You, PY  1998 KW  Logic programming KW  knowledge representation KW  nonmonotonic reasoning KW  belief revision. VL  10 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—In this paper, we present a new approach to the problem of revising extended programs; we base this approach on the
[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, "TopDown Query Evaluation for WellFounded Semantics with Explicit Negation," Proc. ECAI '94, pp. 140144, 1994.
[3] J. Dix, "A Framework for Representing and Characterizing Semantics of Logic Programs," Proc. KR '92, pp. 591602, 1992.
[4] J. Dix, "A Classification Theory of Semantics of Normal Logic Programs: II—Weak Properties, Fundamenta Informaticae, vol. 22, no. 3, pp. 257288, 1995.
[5] P.M. Dung, "Negations as Hypotheses: An abductive Foundation for Logic Programming," Proc. Eighth Int'l Conf. Logic Programming, pp. 317, MIT Press, 1991.
[6] P.M. Dung, "An Argumentation Semantics for Logic Programming with Explicit Negation," Proc. 10th Int'l Conf. Logic Programming, pp. 615630, 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. 185221, 1993.
[9] M. Gelfond and V. Lifschitz (1990), “Logic Programs with Classical Negation,” Proc. of the 7th Intl. Conf. on Logic Programming, pp. 579597, 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,0701,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. 412425, 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. 125157, 1991.
[13] L.M. Pereira and J.J. Alferes, "WellFounded Semantics with Explicit Negation," Proc. 10th ECAI, pp. 102106, 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. 106119, 1991.
[15] T.C. Przymusinski, "The WellFounded Semantics Coincides with the ThreeValued Stable Semantics," Fundamenta Informaticae, vol. 13, pp. 445463, 1990.
[16] D. Saccà and C. Zaniolo, "Stable Models and Nondeterminism for Logic Programs with Negation," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 205217, 1990.
[17] M. Wallace, "Unrestricted Logic Programs, or If Stratification is the Cure, What is the Malady?" Proc. European Conf. AI, pp. 682687, 1990.
[18] C. Witteveen and G. Brewka, "Skeptical Reason Maintenance and Belief Revision," Artificial Intelligence, vol. 61, pp. 136, 1993.
[19] C. Witteveen and C.M. Jonker, "Revision by Expansion in Logic Programs," Report 9302, Faculty of Mathematics and Computer Science, Delft Univ. of Tech nology, 1993.
[20] J.H. You and L. Yuan, “A ThreeValued 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. 209219, 1995.
[22] J. You, R. Cartwright, and M. Li, "Iterative Belief Revision in Extended Logic Programming," Theoretical Computer Science, vol. 70, nos. 12, pp. 383406, 1996.
[23] J. You and L.Y. Yuan, "Logic Programming with Assumption Denials," NonMonotonic Extensions of Logic Programming, J. Dix, L.M. Perira, and T.C. Przymusinski, eds., Lecture Notes in Artificial Intelligence, vol. 927, pp. 85100, 1995.
[24] L.Y. Yuan, "Autoepistemic Logic of First Order and Its Expressive Power," J. Automated Reasoning, vol. 13, pp. 6982, 1994.
[25] L.Y. Yuan and J. You, "Justification Rules and Justified Model Semantics," Proc. Pacific Rim Int'l Conf. AI, pp. 822827, 1990.
[26] L.Y. Yuan and J. You, "Autoepistemic Circumscription and Logic Programming," J. Automated Reasoning, vol. 10, pp. 143160, 1993.