
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
John Grant, V.s. Subrahmanian, "Reasoning in Inconsistent Knowledge Bases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 177189, February, 1995.  
BibTex  x  
@article{ 10.1109/69.368510, author = {John Grant and V.s. Subrahmanian}, title = {Reasoning in Inconsistent Knowledge Bases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {1}, issn = {10414347}, year = {1995}, pages = {177189}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.368510}, 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  Reasoning in Inconsistent Knowledge Bases IS  1 SN  10414347 SP177 EP189 EPD  177189 A1  John Grant, A1  V.s. Subrahmanian, PY  1995 KW  Logic programming KW  deductive databases KW  reasoning with inconsistency KW  nonmonotonic negation. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] H.A. Blair and V.S. Subrahmanian, “Paraconsistent Logic Programming,” Theoretical Computer Science, vol. 68, pp. 135154, 1989.
[2] H.A. Blair and V.S. Subrahmanian (1988), “Paraconsistent Foundations for Logic Programming,” Journal of NonClassical Logic, vol. 5, no. 2, pp. 4573.
[3] N.C.A. da Costa (1974), “On the Theory of Inconsistent Formal Systems,” Notre Dame J. of Formal Logic, vol. 15, pp. 497510.
[4] N.C.A. da Costa,V.S. Subrahmanian, and C. Vago (1989), “The Paraconsistent Logics PT,” Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, vol. 37, to appear in 1991.
[5] M. C. Fitting (1988), “Logic Programming on a Topological Bilattice,” Fundamenta Informaticae, vol. 11, pp. 209218.
[6] M.C. Fitting, “, Bilattices and the Semantics of Logic Programming,” J. Logic Programming, vol. 11, pp. 91116, 1991.
[7] M. Gelfond and V. Lifschitz (1988), “The Stable Model Semantics for Logic Programming,” Proc. of the 5th Intl. Conf./Symp. on Logic Programming, pp. 10701080, MIT Press.
[8] M. Gelfond, and V. Lifschitz (1990), “Logic Programs with Classical Negation,” Proc. of the 7th Intl. Conf. on Logic Programming, pp. 579597, MIT Press.
[9] J. Grant (1974), “Incomplete Models,” Notre Dame J. of Formal Logic, vol. 15, no. 4, pp. 601607.
[10] J. Grant (1975), “, Inconsistent and Incomplete Logics,” Mathematics Magazine, vol. 48, no. 3, pp. 154159, Mathematical Association of America.
[11] J. Grant (1977), “Incompleteness and Inconsistency in Propositional Logic,” Relevant Logic Newsletter, 1977.
[12] J. Grant (1978), “Classifications for Inconsistent Theories,” Notre Dame J. of Formal Logic, vol. 19, no. 3, pp. 435444.
[13] L. J. Henschen and J.J. Lu (1991), “The Paraconsistent Closed World Assumption,” to appear in: Theoretical Computer Science.
[14] Y. Hu, and L.Y. Yuan (1991), “Extended WellFounded Model Semantics for General Logic Programs,” Proc. 8th Intl. Conf. on Logic Programming, pp. 412425, MIT Press.
[15] Y. Ioannidis, and T. Sellis (1989), “Conflict Resolution of Rules Assigning Values to VirtualAttributes,” Proc. ACM SIGMOD Symp. on Management of Data.
[16] M. Kifer, and T. Krishnaprasad (1989), “An Evidence Based Framework for a Theory of Inheritance,” Proc. 1989 International Joint Conference on Artificial Intelligence, August 1989, MorganKauffman.
[17] M. Kifer, and E. Lozinskii, "RI: A Logic for Reasoning with Inconsistency," Proc. Fourth Symp. Logic in Computer Science, pp. 253262,Asilomar, Calif., 1989.
[18] R. Kowalski and F. Sadri (1990), “Logic Programs with Exceptions,” Proc. 7th Intl. Conf. on Logic Programming, pp. 598613.
[19] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[20] J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programming. Cambridge, Mass.: MIT Press, 1992.
[21] T. Murata, V.S. Subrahmanian, and T. Wakayama, "A Petri Net Model for Reasoning in the Presence of Inconsistency," IEEE Trans. Knowledge and Data Eng., Vol. 3, No. 3, Sept. 1991, pp. 281292.
[22] S. Naqvi and F. Rossi (1990), “Reasoning in Inconsistent Databases,” Proc. of the 1990 North American Conf. on Logic Programming, pp. 255272, MIT Press.
[23] S. Pimentel, and W. Rodi (1991), “, Belief Revision and Paraconsistency in a Logic Programming Framework,” Proc. First Intl. Workshop on Logic Prog. and NonMonotonic Reasoning (eds. A. Nerode, W. Marek and V.S.Subrahmanian), pp. 228242, MIT Press.
[24] C. Sakama (1991), Extended WellFounded Semantics for Paraconsistent Logic Programs, draft manuscript  ASTEM Research Institute, Kyoto, Japan.
[25] A. Silberschatz,M. Stonebraker, and J. D. Ullman (1991), “, Database Systems: Achievements and Opportunities,” Communications of the ACM, vol. 34, no. 10, pp. 110120.
[26] V.S. Subrahmanian (1989), “Paraconsistent Disjunctive Deductive Databases,” to appear in: Theoretical Computer Science, spring 1992.
[27] V.S. Subrahmanian (1990), “Mechanical Proof Procedures for ManyValued LatticeBased Logic Programming,” Journal of NonClassical Logic, vol. 7, no. 1/2, pp. 741.
[28] H. Tamaki and T. Sato (1984), “Unfold/Fold Transformations of Logic Programs,” Proc. 2nd Intl. Conf. on Logic Programming, pp. 127138,Uppsala, Sweden.