This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimal State Space Search in Parallel Production Systems
December 1991 (vol. 3 no. 4)
pp. 435-443

A methodology for transforming the original search space into an equivalent but minimal search space is proposed. First, the concept of dependences leads to a procedure for reduction of the search space. The search procedure using this method can produce a minimal and complete search space. It is shown that this method is applicable to parallel search as well. An added advantage of this method is that it does not exclude the use of heuristics. pi - lambda transformation is introduced to reduce the parallel search space.

[1] V. V. Dixit, "Transformation techniques for parallel processing of production systems," Ph.D. dissertation, Dep. Elec. Eng., Univ. of Southern California, Los Angeles, Dec. 1987.
[2] H. Ehrig,Introduction to Algebraic Theory of Graph Grammars, Lecture Notes in Computer Science, Vol. 73. Berlin, Germany: Springer-Verlag, 1978.
[3] C.L. Forgy, "RETE: A fast algorithm for many pattern/many object match problem,"Artif. Intell., vol. 19, no. 1, Sept. 1982.
[4] A. Gupta, "Implementing OPS5 on DADO," inProc. Int. Conf. Parallel Processing, Aug. 1984.
[5] A. Gupta, "Parallelism in production systems: The sources and the expected speed-up," Tech. Rep., Dep. Comput. Sci., Carnegie-Mellon Univ., Dec. 1984.
[6] L. Brownston et al.,Programming Expert Systems in OPS5, An Introduction to Rule-Based Programming, Addison Wesley, Reading, Mass., 1985, Chapter 4, pp. 161- 164.
[7] D.I. Moldovan, "A model for parallel processing of production systems," inProc. Int. Conf. Syst., Man, Cybern., Atlanta, GA, Oct. 1986.
[8] D.I. Moldovan, "RUBIC A multiprocessor for rule-based systems," Tech. Rep., Dep. Elec. Eng., Univ. of Southern California, 1987.
[9] D.I. Moldovan and V.V. Dixit. "Minimal state space search in production systems," Tech. Rep. CRI-87-19, Dep. Elec. Eng., Univ. of Southern California, 1987.
[10] R. Miller and C-K. Yao, "On formulating simultaneity for studying parallelism and synchronization,"J. Comput. Syst. Sci., vol. 20, pp. 203-218, 1980.
[11] M. Nagl,A Tutorial and Bibliographical Survey on Graph Grammars, Lecture Notes in Computer Science, Vol. 73. Berlin, Germany: Springer-Verlag, 1978.
[12] K. Oflazer, "Partitioning in parallel processing of production systems," inProc. Int. Conf. Parallel Processing, Aug. 1984.
[13] F. Parisi-Presicce. H. Ehrig, and U. Montanari. "Graph rewriting with unification and composition," unpublished, 1987.
[14] D. E. Shaw, "Non-von's applicability to three AI task areas," inProc. IJCAI, 1985.
[15] S. J. Stolfo, "Five parallel algorithms for production system execution on the DADO machine," inProc. National Conf. Artif. Intell., AAAI, 1985.
[16] F.M. Tenorio and D.I. Moldovan, "Mapping production systems into multiprocessors," inProc. Int. Conf. Parallel Processing, Aug. 1984.

Index Terms:
minimal state space search; parallel production systems; dependences; heuristics; parallel search space; heuristic programming; knowledge based systems; parallel algorithms; search problems
Citation:
V.V. Dixit, D.I. Moldovan, "Minimal State Space Search in Parallel Production Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 4, pp. 435-443, Dec. 1991, doi:10.1109/69.109105
Usage of this product signifies your acceptance of the Terms of Use.