This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs
April 1988 (vol. 14 no. 4)
pp. 481-497

This paper presents a predicate/transition net model for a subset of Horn clause logic programs. The paper discusses the syntax, transformation procedure, semantics. and deduction process for the net model. A possible parallel implementation for the net model is described, which is based on the concepts of communicating processes and relations. The proposed net model offers a syntactical variant of Horn clause logic and has two distinctions from other existing schemes for the logic programs: representation formalism and the deduction method. The significance of the work is that the net model provides an approach towards the solutions of the separation of logic from control and the improvement of the execution efficiency through parallel processing for the logic programs. The abstract nature of the net model also lends itself to different implementation strategies.

[1] K. R. Apt and M. H. van Emden, "Contributions to the theory of logic programming,"JACM, vol. 29, pp. 841-862, 1982.
[2] A. Barr and E. A. Feigenbaum,The Handbook of Artificial Intelligence, vol. I, Los Altos, CA: William Kaufmann, 1981.
[3] L. Bic, "A data-driven model for parallel interpretation of logic programs," inProc. Int. Conf. 5th Generation Comput. Syst., Tokyo, Japan, 1984, pp. 517-523.
[4] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[5] J. H. Chang, A. M. Despain, and D. DeGroot, "AND-parallelism of logic programs based on static data dependency analysis," inProc. IEEE-CO-MPCON, 1985, pp. 218-225.
[6] A. Ciepielewski and S. Haridi. "A formal model for OR-parallel execution of logic programs," inProc. IFIP Conf., 1983, pp. 299-305.
[7] K. L. Clark and S. Gregory, "PARLOG: Parallel programming in logic,"ACM Trans. Program. Lang., vol. 8, pp. 1-49, 1986.
[8] J. S. Conery and D. F. Kibler, "AND parallelism and nondeterminism in logic programs,"New Generation Comput., vol 3, pp. 43- 70, 1985.
[9] J.S. Conery,Parallel Execution of Logic Programs, Kluwer Academic Publishers, Boston, 1987.
[10] J. L. Darlinton, "A net based theorem prover for program verification and synthesis," GMD-IST Internal Rep.. Dec. 1978.
[11] D. DeGroot, "Restricted AND-parallelism," inProc. Int. Conf. 5th Generation Comput. Syst., Tokyo, Japan, 1984, pp. 471-478.
[12] A. Deliyanni and R. A. Kowalski, "Logic and semantic networks,"Commun. ACM, vol. 22, no. 3, pp. 184-192, 1979.
[13] K. Furukawa, K. Nitta, and Y. Matsumoto, "A backup parallel interpreter for prolog programs," inLogic Programming and Its Appllications. M. van Caneghem and D. H. D. Warren, Eds. Norwood, NJ: Ablex, 1986, pp. 91-102.
[14] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[15] H. J. Genrich and G. Thieler-Mevissen, "The calculus of facts," inLecture Notes in Computer Science, vol. 45, 1976, pp. 588-595.
[16] H. J. Genrich and K. Lautenbach, "Facts in place/transition nets," inLecture Notes in Computer Science, vol. 64, 1978. pp. 213-231.
[17] H. J. Genrich and K. Lautenbach, "The analysis of distributed systems by means of predicate/ transition nets," inLecture Notes in Computer Science. vol. 70, 1979, pp. 125-146.
[18] H. J. Genrich, K. Lautenbach, and P. S. Thiagarajan, "Elements of general net theory," inLecture Notes in Computer Sci., vol. 84, 1980, pp. 21-163.
[19] H. J. Genrich and K. Lautenbach, "System modelling with high-level Petri nets,"Theoretical Comput. Sci., vol. 13, pp. 109-136, 1981.
[20] H. J. Genrich and K. Lautenbach, "S-invariance in predicate/transition nets," GMD Internal Rep., 1982.
[21] A. Giordana and L. Saitta, "Modeling production rules by means of predicate transition networks,"Inform. Sci., vol. 35, pp. 1-41, 1985.
[22] R. Hasegawa and M. Amamiya, "Parallel execution of logic programs based on dataflow concept," inProc. Int. Conf. 5th Generation Comput. Syst., Tokyo, Japan, 1984, pp. 507-516.
[23] C. J. Hogger,Introduction to Logic Programming. London: Academic, 1984.
[24] K. Jensen, "Coloured Petri nets and the invariant method,"Theoretical Comput. Sci., vol. 14, pp. 317-336, 1981.
[25] K. Jensen, "How to find invariants for coloured Petri nets." inLecture Notes in Computer Science, vol. 118, 1981, pp. 327-338.
[26] W. E. Kluge and H. Schlutter, "Petri net model for the evaluation of applicative programs based on X-expressions,"IEEE Trans. Software Eng., vol. SE-9, pp. 415-427, 1983.
[27] R. Kowalski, "Predicate logic as programming language," inProc. IFIP Conf., 1974, pp. 569-574.
[28] R. Kowalski, "Algorithm = Logic + Control,"Comm. ACM, Vol. 22, No. 7, July 1979, pp. 424-436.
[29] R. Kowalski,Logic for Problem Solving. New York: North-Holland, 1979.
[30] R. Kowalski, "Logic programming," inProc. IFIP Conf., 1983, pp. 133- 145.
[31] R. Kowalski, "Directions for logic programming," inProc. 2nd IEEE Int. Symp. Logic Programming, 1985, pp. 2-7.
[32] K. Lautenbach and A. Pagnoni, "Invariance and duality in predicate/ transition nets and in colored nets," GMD Internal Rep. 1985.
[33] K. Lautenbach, "On logical and linear dependencies," GMD Internal Rep., 1985.
[34] G. Lindstmm and P. Panangaden, "Stream based execution of logic programs," inProc. 1st IEEE Int. Symp. Logic Programming, 1984, pp. 168-176.
[35] G. J. Lipovski and M. V. Hermenegildo, "B-log: A branch and bound methodology for the parallel execution of logic programs," inProc. IEEE Int. Conf. Parallel Processing. 1985, pp. 560-567.
[36] J. W. Lloyd,Foundations of Logic Programming, New York: Springer, 1984.
[37] E. L. Lozinskii, "A problem-oriented inferential database system,"ACM Trans. Database Syst., vol. 11, pp. 323-356, 1986.
[38] J. Martinez and M. Silva, "A simple and fast algorithm to obtain all invariants of a generalized petri net," inProc. 2nd European Workshop Applications and Theory of Petri Nets, 1981, pp. 411-421.
[39] T. Murata, "Modeling and analysis of concurrent systems," inHandbook of Software Engineering, C. R. Vick and C. V. Ramamoorthy, Eds. New York: van Nostrand Reinhold, 1984, pp. 39-63.
[40] T. Murata and D. Zhang, "A high-level Petri net model for parallel interpretation of logic programs," inProc. IEEE Int. Conf. Comput. Lang., 1986, pp. 123-132.
[41] T. Murata and G. Peterka, "Application of colored Petri net T-invariants to logic programming," inProc. 5th Int. Conf. Syst. Eng., 1987.
[42] Y. Narahari and N. Viswanadham, "On the invariants of coloured Petri nets," inProc. 6th European Workshop Applications and Theory of Petri Nets. 1985, pp. 277-292.
[43] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[44] L. M. Pereiraetal.. "Delta Prolog: A distributed backtracking extension with events," inProc. 3rd Int. Conf. Logic Programming, 1986, pp. 69-83.
[45] J. L. Peterson and T. H. Bredt, "A comparison of models of parallel computation," inProc. IFIP Conf., 1974, pp. 466-470.
[46] J. L. Peterson, "Petri nets,"ACM Comput. Surveys, vol. 9, no. 3, pp. 223-252, Sept. 1977.
[47] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[48] R. J. Popplestone, "Relational programming," inMachine Intelligence, vol. 9, J. E. Hayes, D. Michie, and L. I. Mikulich. Eds. Edinburgh, Scotland: Edinburgh University Press, 1979, pp. 3-26.
[49] W. Reisig,Petri Nets. New York: Springer-Verlag, 1985.
[50] J. A. Robinson, "A machined-oriented logic based on the resolution principle,"J. Assoc. Comput. Mach., vol. 12, no. 1, pp. 23-41, Jan. 1965.
[51] J. A. Robinson, "Automatic deduction with hyper-resolution,"Int. J. Comput. Math., vol. I, pp. 227-234, 1965.
[52] J. A. Robinson, "Logic programming: Past, present and future." ICOT, Tech. Rep. TR-015, 1983.
[53] E. Y. Shapiro, "A subset of concurrent Prolog and its interpreter," ICOT, Tech. Rep. TR-003, 1983.
[54] S. Sickel, "A search technique for clause interconnectivity graphs,"IEEE Trans. Comput., vol. C-25, pp. 823-835, 1976.
[55] M. Silva, J. Martinez, P. Ladet, and H. Alla, "Generalized inverses and the calculation of symbolic invariants for colored Petri nets,"Technique et Science Informatiques, vol. 4, no. 1, pp. 113-126, 1985.
[56] R. Steinmetz and S. Theissen, "Integration of Petri nets into a tool for consistency checking of expert systems with rule-based knowledge representation," inProc. 6th European Workshop Applications and Theory of Petri Nets, 1985, pp. 35-52.
[57] L. Sterling and E. Shapiro,The Art of Prolog. Cambridge, MA: MIT Press, 1986.
[58] S. A. Tarnlund, "Logic programming: From a logic point of view," inProc. 3rd IEEE Int. Symp. Logic Programming, 1986, pp. 96-103.
[59] S. Tayloret al., "Logic programming using parallel associative operations," inProc. 1st IEEE Int. Symp. Logic Programming, 1984, pp. 58-68.
[60] G. Thieler-Mevissen, "The Petri net calculus of predicate logic," GMD Int. Rep.. 1976.
[61] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[62] G. J. Vanderbrug and J. Minker, "State-space, problem-reduction. and theorem proving-Some relationships,"Commun.ACM, vol. 18, pp. 107-115, 1975.
[63] 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.
[64] D. Zhang and T. Murata, "Fixpoint semantics for Petri net model of Horn clause logic programs," Univ. Illinois at Chicago. 1987, Tech. Rep. UIC-EECS87-2 also submitted for publication.

Index Terms:
AND/OR parallelisms, communicating processes, deduction process, fixpoint semantics, Horn clause logic programs, logic programming, Petri nets, predicate/transition nets, relational operations.
Citation:
T. Murata, D. Zhang, "A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs," IEEE Transactions on Software Engineering, vol. 14, no. 4, pp. 481-497, April 1988, doi:10.1109/32.4671
Usage of this product signifies your acceptance of the Terms of Use.