Eliminating Expensive Chunks by Restricting Expressiveness
暂无分享,去创建一个
[1] Charles L. Forgy,et al. Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..
[2] Allen Newell,et al. R1-Soar: An Experiment in Knowledge-Intensive Programming in a Problem-Solving Architecture , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Steven Minton,et al. Selectively Generalizing Plans for Problem-Solving , 1985, IJCAI.
[4] John E. Laird,et al. Mapping Explanation-Based Generalization onto Soar , 1986, AAAI.
[5] Daniel P. Miranker. TREAT: a better match algorithm for AI production systems , 1987, AAAI 1987.
[6] Anoop Gupta. Parallelism in production systems , 1987 .
[7] Allen Newell,et al. SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..
[8] Allen Newell,et al. Some Chunks Are Expensive , 1988, ML.
[9] Allen Newell,et al. Soar/PSM-E: investigating match parallelism in a learning production sytsem , 1988, PPEALS '88.
[10] Richard M. Keller,et al. Defining Operationality for Explanation-Based Learning , 1987, Artificial Intelligence.
[11] Jaime G. Carbonell,et al. Learning effective search control knowledge: an explanation-based approach , 1988 .
[12] Allen Newell,et al. Soar/PSM-E: investigating match parallelism in a learning production sytsem , 1988, PPoPP 1988.
[13] John E. Laird,et al. Symbolic architectures for cognition , 1989 .