
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
L. Li, "HighLevel Petri Net Model of Logic Program with Negation," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 3, pp. 382395, June, 1994.  
BibTex  x  
@article{ 10.1109/69.334863, author = {L. Li}, title = {HighLevel Petri Net Model of Logic Program with Negation}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {6}, number = {3}, issn = {10414347}, year = {1994}, pages = {382395}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.334863}, 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  HighLevel Petri Net Model of Logic Program with Negation IS  3 SN  10414347 SP382 EP395 EPD  382395 A1  L. Li, PY  1994 KW  nonmonotonic reasoning; logic programming; Petri nets; expert systems; Horn clauses; highlevel Petri net model; normal logic program; negation; nonmonotonic reasoning; logic programming; semantics; uniform model; inference control; predicate/transition nets; PrTnets; production rule based expert systems; Horn clause logic programs; inconsistency VL  6 JA  IEEE Transactions on Knowledge and Data Engineering ER   
The formalism of nonmonotonic reasoning has been integrated into logic programming to define semantics for logic program with negation. Because a Petri net provides a uniform model for both the logic of knowledge and the control of inference, the class of highlevel Petri nets called predicate/transition nets (PrTnets) has been employed to study production rule based expert systems and Horn clause logic programs. We show that a PrTnet can implement the nonmonotonicity associated with a logic program with negation as well as the monotonicity of Horn clause logic program. In particular, we define a semantics for a normal logic program and implement it with PrTnet. We demonstrate that in the presence of inconsistency in a normal logic program, the semantics still works well by deducing meaningful answers. The variations and potential applications of the PrTnet are also addressed.
[1] G. Brewka,Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge, UK: Cambridge University Press, 1991.
[2] K. L. Clark, "negationasfailure," in H. Gallaire and J. Minker, Eds.,Logic and Data Bases. New York: Plenum, 1978, pp. 293322.
[3] A. Van Gelder, A. Ross, and J. S. Schlipf, "The wellfounded semantics for general logic programs," in7th ACM Symp. Principles Database Syst. (PODS), Mar. 1988, pp. 221230.
[4] A. Van Gelder, "The wellfounded semantics for general logic programs,"J. ACM, vol. 38, pp. 620650, 1991.
[5] M. Gelfond and V. Lifschitz, "The stable model semantics for logic programming," inProc. 5th Int. Conf. Symp. Logic Programming, 1988, pp. 10701080.
[6] M. Gelfond and V. Lifschitz, "Logical program with classical negation," inProc. 7th Int. Conf. Symp. Logic Programming, 1990, pp. 579597.
[7] A. Giordana and L. Saitta, "Modeling production rules by means of predicate transition networks,"Inform. Sci., vol. 35, pp. 141, 1985.
[8] R. A. Kowalski, "Predicate logic as a programming language,"Inform. Processing '74, 1974, pp. 569574.
[9] L. Li and J.H. You, "Making default inferences from logic programs,"Computational Intell., vol. 7, pp. 142153, 1991.
[10] J.W. Lloyd,Foundations of Logic Programming, SpringerVerlag, New York, 1987.
[11] J. McCarthy, "Circumscription: A form of nonmonotonic reasoning,"Artificial Intell., vol. 13, pp. 2739, 1980.
[12] R. Moore, "Semantical considerations on nonmonotonic logic,"Art. Intell., vol. 25, pp. 7594, 1985.
[13] T. Murata and V. S. Subrahmanian, and T. Wakayama, "A Petri net model for reasoning in the presence of inconsistency,"IEEE Trans. Knowl. Data Eng., vol. 3, pp. 281292, 1991.
[14] T. Murata and D. Zhang, "A predicatetransition net model for parallel interpretation of logic programs,"IEEE Trans. Software Eng., vol. 14, pp. 481497, 1988.
[15] G. Peterka and T. Murata, "Proof procedure and answer extraction in Petri net model of logic programs,"IEEE Trans. Software Eng., vol. 15, pp. 209217, 1989.
[16] T. Przymusinski, "Every logic program has a natural stratification and an iterated least fixed point model," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 1121.
[17] W. Reisig, "Petri nets: An introduction," inEATCS Monographs on Theoretical Computer Science. New York: SpringerVerlag, 1985.
[18] R. Reiter, "A logic for default reasoning,"Artificial Intell., vol. 13, pp. 81132, 1980.
[19] K. A. Ross, "A procedural semantics for well founded negation in logic programs," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 2232.
[20] M. H. van Emden and R. A. Kowalski, "The semantics of predicate logic as a programming language,"J. ACM, vol. 23, no. 4, pp. 733 743, 1976.