Download biblography

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
Литература по алгоритмам сопоставления
Синим цветом обозначены публикации, которые есть у меня только в бумажном виде.
Rete
1. Forgy, Charles L. “Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern
Matching Problem.” Artificial Intelligence, Vol. 19, № 1, 1982, pp. 17-37.
2. Schor, M., T. Daly, H. S. Lee, and B. Tibbits. “Advances in Rete pattern matching.”
Proceedings of the Fifth National Conference on Artificial Intelligence, AAAI, Philadelphia,
1986, pp. 226-232.
3. Scales, D. “Efficient matching algorithms for the SOAR/OPS5 production system.”
Technical Report KSL 86-47, Knowledge Systems Laboratory, Department of Computer
Science, Stanford University, Stanford, 1986.
4. Tambe M., D. Kalp, A. Gupta, C. L. Forgy, B. Milnes, and A. Newell. “Soar/PSM-E:
Investigating Match Parallelism in a Learning Production System.” Department of
Computer Science, Carnegie-Mellon University, 1988.
5. Lee H. S. and M. Schor. “Dynamic augmentation of generalized Rete networks for demanddriven matching and rule updating.” Proceedings of the Sixth IEEE Conference on Artificial
Intelligence Applications, 1990, pp. 123-129.
6. Lee Ho Soo and Marshall I. Schor. “Match algorithms for generalized Rete networks.”
Artificial Intelligence, Vol. 54, № 3, 1992, pp. 249-274.
TREAT
7. Miranker, Daniel. “TREAT: a better match algorithm for AI production system.”
Proceedings of the Sixth National Conference on Artificial Intelligence, AAAI, 1987,
pp. 42-47.
8. Nayak P., A. Gupta, and P. Rosenbloom. “Comparison of the Rete and Treat Production
Matchers for Soar (A Summary).” Proceedings of the Seventh National Conference on
Artificial Intelligence, AAAI, 1988, pp. 693-698.
9. Miranker, Daniel. TREAT: A New and Efficient Match Algorithm for AI Production Systems.
London: Pittman/San Mateo, CA: Morgan Kaufmann, 1990.
10. Miranker, D. and B. Lofaso. “The Organization and Performance of a TREAT-Based
Production System Compiler.” IEEE Transactions on Knowledge and Data Engineering,
Vol. 3, № 1, 1991, pp. 3-10.
11. Wang, Yu-Wang and Eric N. Hanson. “A Performance Comparison of the Rete and TREAT
Algorithms for Testing Database Rule Conditions.” Proceedings of the Eighth International
Conference on Data Engineering, 1992, pp. 88-97.
LEAPS
12. Miranker, D., and D. A. Brant. “An Algorithmic Basis for Integrating Production Systems
and Database Systems.” Proceedings of the Sixth International Conference on Data
Engineering, 1990, pp. 353-360.
13. Miranker D., D. Brant, B. Lofaso, and D. Gadbois. “On the Performance of Lazy Matching
in Production Systems.” Proceedings of the Eighth National Conference on Artificial
Intelligence, AAAI, Boston, 1990, pp. 685-692.
14. Brant, David A., Timothy Grose, Bernie Lofaso, and Daniel P. Miranker. “Effects of
Database Size on Rule System Performance: Five Case Studies.” Proceedings of the 17th
International Conference on Very Large Data Bases, Barcelona, Spain, 1991, pp. 287-296.
15. Brant D. and D. Miranker, “Index Support for Rule Activation.” Proceedings of the 1993
ACM SIGMOD International Conference on Management of Data, 1993, pp. 42-48.
16. Batory, Don. “The LEAPS Algorithms.” Technical Report CS-TR-94-28, Department of
Computer Sciences, University of Texas at Austin, 1994.
17. Batory, D., J. Thomas, and M. Sirkin. “Reengineering a Complex Application Using a
Scalable Data Structure Compiler.” Proceedings of the 2nd ACM SIGSOFT symposium on
Foundations of software engineering, New Orleans, 1994, pp. 111-120.
Related documents