
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
T. Murata, V.S. Subrahmanian, T. Wakayama, "A Petri Net Model for Reasoning in the Presence of Inconsistency," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 3, pp. 281292, September, 1991.  
BibTex  x  
@article{ 10.1109/69.91059, author = {T. Murata and V.S. Subrahmanian and T. Wakayama}, title = {A Petri Net Model for Reasoning in the Presence of Inconsistency}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, number = {3}, issn = {10414347}, year = {1991}, pages = {281292}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.91059}, 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  A Petri Net Model for Reasoning in the Presence of Inconsistency IS  3 SN  10414347 SP281 EP292 EPD  281292 A1  T. Murata, A1  V.S. Subrahmanian, A1  T. Wakayama, PY  1991 KW  Petri net model; reasoning; inconsistency; queries; logic programs; query processing; logic programming; classical logic; large expert systems; expert systems; inference mechanisms; logic programming; Petri nets; query languages VL  3 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Petri nets provide a promising framework for executing queries to logic programs. Petri net models for query processing in logic programming were initially developed by T. Murata and D. Zhang (IEEE Trans. Software Eng., vol.14, no.4, p.48197, 1988). It is shown how this framework can be extended to be applicable to reasoning in the presence of inconsistency. This yields a Petri net model of programs that be inconsistent in classical logic. This is interesting because large expert systems may often contain inconsistent information. The Petri net method proposed suggests a robust way of preventing inconsistency from infecting a system and rendering it useless.
[1] N. D. Belnap, "A useful four valued logic, " inModern Uses of MultipleValued Logics, G. Epstein and M. Dunn, Eds. Boston, MA: Reidel, 1977.
[2] H. A. Blair and V. S. Subrahmanian, "Paraconsistent logic programming,"Theoret. Comput. Sci., vol. 68, no. 1, pp. 135154, 1989. Preliminary version appeared inLecture Notes in Computer Science, vol. 287, 1987, pp. 340360.
[3] H. A. Blair and V. S. Subrahmanian, "Paraconsistent foundations for logic programming,"J. NonClassical Logic, vol. 5, no. 2, pp. 4673, 1988.
[4] H. A. Blair and V. S. Subrahmanian, "Strong completeness results for paraconsistent logic programming," submitted for publication.
[5] N. C. A. da Costa, V. S. Subrahmanian, and C. Vago, "The Paraconsistent logicsPT," Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, vol. 37, 1991, to be published
[6] J. L. Darlington, "A netbased theorem prover for program verification and synthesis," Gesellschaft fur Math. und Datenverarbeiting Bonn, Interner Bericht des IST 3/79, 1979.
[7] H. J. Genrich, "Predicate/transition nets," inPetri Nets Central Models and Their Properties, W. Brauer, Ed. Berlin, Heidelberg, New York: SpringerVerlag, 1987, pp. 207247.
[8] H. J. Genrich and K. Lautenbach, "System modeling with high level Petri nets,"Theoret. Comput. Sci., vol. 13, pp. 109136, 1981.
[9] H. J. Genrich and G. ThielerMevissen, "The calculus of fact," inProc. 1976 Symp. Math. Foundations Comput. Sci., A. Mazurkiewicz, Ed. Berlin, Germany: SpringerVerlag, 1976, pp. 588595.
[10] A. Giordana and L. Saitta, "Modeling production rules by means of predicate transition networks,"Inform. Sci., vol. 35, pp. 141, 1985.
[11] K. Lautenbach, "On logical and linear dependencies," Gesellschaft fur Math. und Datenverarbeiting Bonn, Arbeitspapiere der GMD Nr. 147, 1985.
[12] J. W. Lloyd,Foundations of Logic Programming, New York: Springer, 1984.
[13] C. G. Looney, "Fuzzy Petri nets for rulebased decisionmaking,"IEEE Trans. Syst., Man, Cybern., vol. SMC18, no. 1, pp. 178183, Jan./Feb. 1988.
[14] T. Murata and K. Matsuyama, "Inconsistency check of a set of clauses using Petri net reductions,"J. Franklin Institute, vol. 325, no. 1, pp. 7393, 1988.
[15] G. Peterka and T. Murata, "Proof procedure and answer extraction in Petri net model of logic programs,"IEEE Trans. Software Eng., Feb. 1989.
[16] T. Murata and D. Zhang, "A hight level Petri net model for parallel interpretation of logic programs, " inProc. IEEE Conf. Comput. Languages, 1986, pp. 123132.
[17] T. Murata and D. Zhang, "A predicatetransition net model for parallel interpretation of logic programs,"IEEE Trans. Software Eng., vol. SE14, no. 4, pp. 481497, 1988.
[18] D. Zhang and T. Murata, "Fixpoint semantics for Petri net model of definite clause logic programs,"Advances in the Theory of Computation and Computational Mathematics, Vol. 1. Norwood, NJ: Ablex, 1991, to be published
[19] T. Murata, "Petri nets: Properties, analysis, and applications,"Proc. IEEE, vol. 77, no. 4, pp. 541580, Apr. 1989.
[20] W. Reisig, "Petri nets: An introduction," inEATCS Monographs on Theoretical Computer Science. New York: SpringerVerlag, 1985.
[21] G. ThielerMevissen, "The Petri net calculus of predicate logic," Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF7609, 1976.