
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Teruhiro Shimura, Jorge Lobo, Tadao Murata, "An Extended Petri Net Model for Normal Logic Programs," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 150162, February, 1995.  
BibTex  x  
@article{ 10.1109/69.368512, author = {Teruhiro Shimura and Jorge Lobo and Tadao Murata}, title = {An Extended Petri Net Model for Normal Logic Programs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {1}, issn = {10414347}, year = {1995}, pages = {150162}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.368512}, 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  An Extended Petri Net Model for Normal Logic Programs IS  1 SN  10414347 SP150 EP162 EPD  150162 A1  Teruhiro Shimura, A1  Jorge Lobo, A1  Tadao Murata, PY  1995 KW  Logic programming KW  inhibitor arcs KW  negations KW  normal logic programs KW  Petri nets KW  siphons (deadlocks) KW  wellfounded semantics. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] K.R. Apt and M.H. van Emden, "Contributions to the Theory of Logic Programming," J. ACM, vol. 29, no. 3, pp. 841862, July 1982.
[2] C. Baral and V.S. Subrahmanian,“Dualities between alternative semantic for logic programming andnonmonotonic reasoning,” Proc. First Int’l Workshop of Logic Programming and NonMonotonic Reasoning,Cambridge, Mass.: MIT Press, pp. 6986, 1991.
[3] M. Gelfond and V. Lifschitz,“The stable model semantics for logic programming,” Proc. Fifth Int’l Conf. and Symp. on Logic Programming,New York: IEEE, pp. 10701080, 1988.
[4] M. Gelfond and H. Przymusinska,“Definitions in epistemic specifications,” Proc. First Int’l Workshop of Logic Programming and NonMonotonic Reasoning,Cambridge, Mass.: MIT Press, pp. 245259, 1991.
[5] V. Lifschitz,“Logical foundationsof deductive databases,” Information Processing Letters, vol. 89, pp. 315321, 1989.
[6] C. Lin and T. Murata,“Applications of Petri nets to nonmonotonic logic,” Proc. Joint Technical Conf. CircuitsSystems, Computer, and Comm., pp. 530535,Cheju, Korea, Dec.1011, 1990.
[7] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[8] W. Marek and V.S. Subrahmanian,“The relationship between logic programs and nonmonotonic reasoning,” Proc. Sixth Int’l Conf. Logic Programming, pp. 600620, 1989.
[9] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[10] 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.
[11] T. Murata and J. Yim,“Petri net method for realtime control of rulebased systems,” KSI Proc. First Int’l Conf. Software Eng. and Knowledge Eng.,Skokie, Ill., June 1989.
[12] T. Murata and D. Zhang, "A PredicateTransition Net Model for Parallel Interpretation of Logic Programs," IEEE Trans. Software Eng., Vol. 14, No. 4, Apr. 1988, pp. 481497.
[13] J.L. Peterson, Petri Net Theory and the Modeling of Systems.Englewood Cliffs, N.J.: Prentice Hall, 1981.
[14] T.C. Przymusinski, "Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 1121, 1989.
[15] T.C. Przymusinski, "On the Declarative Semantics of Deductive Databases and Logic Programs," J. Minker, ed., Foundations of Deductive Databases and Logic Programming, pp. 193216. Morgan Kaufmann, 1988.
[16] T.C. Przymusinski,“Threevalued formalizations of nonmonotonic reasoning and logic programming,” Proc. First Int’l Conf. Knowledge Representation and Reasoning, pp. 341348, 1989.
[17] R. Reiter,“A logic for default reasoning,” Artificial Intelligence, vol. 13, pp. 81132, Apr. 1980.
[18] T. Shimura,J. Lobo,, and T. Murata,“A Petri net semantics for logic programs with negation,” Proc. Fourth Int’l Conf. Software Eng. and Knowledge Eng.,Capri, Italy, June, 1992.
[19] M.H. van Emden and R.A. Kowalski, “The Semantics of Predicate Logic as a Programming Language,” J. ACM, vol. 23, no. 4, pp. 733742, Oct. 1976.
[20] A. van Gelder, "The Alternating Fixpoint of Logic Programs with Negation," Proc. ACM Symp. Principles of Database Systems, pp. 110, 1989.
[21] A. van Gelder,K. Ross, and J.S. Schlipf,"The wellfounded semantics for general logic programs," J. ACM, vol. 38, no. 3, pp. 620650, July 1991.
[22] D. Zhang and T. Murata,“Fixpoint semantics for predicate/transition netmodel for Horn clause logic programs,” to appear in Advances in Theory of Computation and Computational Mathematics, vol. 1, Norwood, N.J: Ablex.
[23] J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programming. Cambridge, Mass.: MIT Press, 1992.