This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dependability of AI Systems: Guest Editor's Introduction
February 1995 (vol. 7 no. 1)
pp. 1-3

[1] H.A. Blair and V.S. Subrahmanian (1989), “Paraconsistent Logic Programming,” Theoretical Computer Science, vol. 68, pp. 135-154. Preliminary version in: Lecture Notes in Computer Science, vol. 287, Dec. 1987.
[2] H.A. Blair, and V.S. Subrahmanian (1988), “Paraconsistent Foundations for Logic Programming,” Journal of Non-Classical Logic, vol. 5, no. 2, pp. 45-73.
[3] N.C.A. da Costa (1974), “On the Theory of Inconsistent Formal Systems,” Notre Dame J. of Formal Logic, vol. 15, pp. 497-510.
[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. 209-218.
[6] M. C. Fitting (1988), “, Bilattices and the Semantics of Logic Programming,” to appear in: Journal of Logic Programming.
[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. 1070-1080, MIT Press.
[8] 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.
[9] J. Grant (1974), “Incomplete Models,” Notre Dame J. of Formal Logic, vol. 15, no. 4, pp. 601-607.
[10] J. Grant (1975), “, Inconsistent and Incomplete Logics,” Mathematics Magazine, vol. 48, no. 3, pp. 154-159, 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. 435-444.
[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 Well-Founded Model Semantics for General Logic Programs,” Proc. 8th Intl. Conf. on Logic Programming, pp. 412-425, 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, Morgan-Kauffman.
[17] M. Kifer, and E.L. Lozinskii (1989), “RI: A Logic for Reasoning with Inconsistency,” 4-th Symposium on Logic in Computer Science,Asilomar, CA, pp. 253-262.
[18] R. Kowalski, and F. Sadri (1990), “Logic Programs with Exceptions,” Proc. 7th Intl. Conf. on Logic Programming, pp. 598-613.
[19] J.W. Lloyd (1987) Foundations of Logic Programming, Springer.
[20] J. Lobo,J. Minker, and A. Rajasekar (1992), Foundations of Disjunctive Logic Programming, MIT Press.
[21] T. Murata,V.S. Subrahmanian, and T. Wakayama (1991), “A Petri Net Model for Reasoning in the Presence of Inconsistency,” , IEEE Trans. on Knowledge and Data Engineering, vol. 3, no. 3, pp. 281-292, Sep. 1991.
[22] S. Naqvi and F. Rossi (1990), “Reasoning in Inconsistent Databases,” Proc. of the 1990 North American Conf. on Logic Programming, pp. 255-272, 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 Non-Monotonic Reasoning (eds. A. Nerode, W. Marek and V.S.Subrahmanian), pp. 228-242, MIT Press.
[24] C. Sakama (1991), Extended Well-Founded 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. 110-120.
[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 Many-Valued Lattice-Based Logic Programming,” Journal of Non-Classical Logic, vol. 7, no. 1/2, pp. 7-41.
[28] H. Tamaki and T. Sato (1984), “Unfold/Fold Transformations of Logic Programs,” Proc. 2nd Intl. Conf. on Logic Programming, pp. 127-138,Uppsala, Sweden.

Citation:
Jeffrey J.P. Tsai, "Dependability of AI Systems: Guest Editor's Introduction," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 1-3, Feb. 1995, doi:10.1109/TKDE.1995.10001
Usage of this product signifies your acceptance of the Terms of Use.