Constraint satisfaction for production system match

An attempt is made to improve production system match by incorporating the arc consistency (AC) algorithm, in the RETE algorithm. This approach combines the constraint graphs of RETE and AC into a single network, which is then incrementally updated. Empirical studies show the technique to be most efficacious with expensive rules. Thus, by using the lookahead from AC preprocessing, in many cases costly RETE computation can be effectively reduced.<<ETX>>

[1]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[2]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[3]  Jeremy M. Wertheimer.  Derivation of an Efficient Rule System Pattern Matcher , 1989 .

[4]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[5]  Mark W. Perlin.  Automating the construction of efficient artificial intelligence algorithms , 1992 .

[6]  Daniel P. Miranker.  TREAT: A new and efficient match algorithm for AI production systems , 1988 .

[7]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[8]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[9]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[10]  A. Newell,et al.  The Problem of Expensive Chunks and its Solution by Restricting Expressiveness , 1990 .

[11]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[12]  Mark W. Perlin,et al.  Scaffolding the RETE network , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.

[13]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[14]  Mark W. Perlin.  Incremental binding-space match: the linearized matchbox algorithm , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[15]  Mark W. Perlin.  Constraint-based specification of production rules , 1989, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence.

[16]  David E. Smith,et al.  Ordering Conjunctive Queries , 1985, Artif. Intell..

[17]  Robert Paige,et al.  Finite Differencing of Computable Expressions , 1982, TOPL.

[18]  Mark W. Perlin,et al.  Transforming Conjunctive Match into Rete: a Call-Graph Caching Approach , 1991, Int. J. Softw. Eng. Knowl. Eng..

[19]  Mark W. Perlin.  Factored Arc Consistency for Rete Match , 1993, Int. J. Artif. Intell. Tools.

[20]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[21]  Mark W. Perlin,et al.  Topologically Traversing the RETE network , 1990, Appl. Artif. Intell..

[22]  Charles L. Forgy,et al.  OPS5 user's manual , 1981 .

[23]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[24]  Mark W. Perlin.  Arc Consistency for Factorable Relations , 1992, Artif. Intell..

[25]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[26]  Daniel J. Scales.  Efficient matching algorithms for the Soar/OPS5 production system , 1986 .

[27]  Toru Ishida,et al.  Optimizing Rules in Production System Programs , 1988, AAAI.