Proceedings

Knowledge Analysis on Process Models

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 935-941.

© 2001 International Joint Conferences on Artificial Intelligence

Abstract

Helping end users build and check process models is a challenge for many science and engineering fields. Many AI researchers have investigated useful ways of verifying and validating knowledge bases for ontologies and rules, but it is not easy to directly apply them to checking process models. Other techniques developed for checking and refining planning knowledge tend to focus on automated plan generation rather than helping users author process information. In this paper, we propose a complementary approach which helps users author and check process models. Our system, called KANAL, relates pieces of information in process models among themselves and to the existing KB, analyzing how different pieces of input are put together to achieve some effect. It builds interdependency models from this analysis and uses them to find errors and propose fixes. Our initial evaluation shows that KANAL was able to find most of the errors in the process models and suggest useful fixes including the fixes that directly point to the sources of the errors.

  1. [Alberts et al., 1998] Alberts, B., Bray, D., Johnson, A., Lewis, J., Raff, M., Roberts, K. & Walter, P. Essential Cell Biology: An Introduction to the Molecular Biology of the Cell. Garland Publishing Inc, 1998.
  2. [Basili, 1987] Basili, V. & Selby R. Comparing the effective- ness of software testing strategies. In IEEE Transactions on Software Engineering, 13(12), 1987.
  3. [Chien, 1998] Chien, S. Static and completion analysis for knowledge acquisition, validation and maintenance of planning knowledge bases. In International Journal of Human-Computer Studies, 48, pp. 499-519, 1998.
  4. [Clark & Porter, 1997] Clark, P. & Porter, B. Building con- cept representations from reusable components. In Pro- ceedings of AAAI-97, pp. 369-376, 1997.
  5. [Clark & Porter, 2000] Clark, P. & Porter, B. The knowledge machine. In http://www.cs.utexas.edu/users/mfkb/km.html, 2000. Link
  6. [Ghallab et al., 1998] Ghallab, M., Howe, A., Knoblock, C., McDermott, D., Ram, A., Veloso, M., Weld, D. & Wilkins, D. PDDL -the planning domain definition language. Technical report, Yale University. Available at http://www.cs.yale.edu/pub/mcdermott/software/pddl.tar.gz. Link
  7. [Huffman & Laird, 1995] Huffman, S. & Laird, J. Flexibly instructable agents. In Journal of Artificial Intelligence Research, 3:271-324, 1995.
  8. [Kambhampati, Knoblock, & Yang, 1995] Kambhampati, S.; Knoblock, C.; and Yang, Q. 1995. Planing as refine- ment search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence 76:167-238.
  9. [Kim & Gil, 1999] Kim, J. & Gil, Y. Deriving expecta- tions to guide knowledge base creation. In Proceedings of AAAI-99, pp. 235-241, 1999.
  10. [Kim & Gil, 2000] Kim, J. & Gil, Y. Acquiring problem- solving knowledge from end users: Putting interdepen- dency models to the test. In Proceedings of AAAI-2000, pp. 223-229, 2000.
  11. [McGuinness et al., 2000] McGuinness, D., Fikes, R., Rice, J. & Wilder, S. An Environment for Merging and Testing Large Ontologies. In Proceedings of KR-2000, 2000
  12. [Myers, 1996] Myers, K. Strategic advice for hierarchical planners. In Proceedings of KR-96, 1996.
  13. [O'Keefe & O'Leary, 1994] O'Keefe, R. & O'Leary, D. Ex- pert system verification and validation. In Expert Systems with Applications: An International Journal, 6(1): 57-66.
  14. [Preece & Shinghal, 1994] Preece, A. & Shinghal, R. Foun- dation and application of knowledge base verification. In International Journal of Intelligent Systems, 9(8): 683- 702, 1994
  15. [Sacerdoti, 1977] Sacerdoti, E. 1977. A Structure for Plans and Behavior. New York: Elsevier.
  16. [Scholer et al., 2000] Scholer, A., Rickel, J., Angros, R. & Johnson, L. Learning domain knowledge for teaching pro- cedural tasks. In AAAI-2000 Fall symposium on Learning How to Do Things, 2000
  17. [Swartout & Gil, 1995] Swartout, W. & Gil, Y. EXPECT: Explicit representations for flexible acquisition. In Pro- ceedings of KAW-95, 1995.
  18. [Tate, 1977] Tate, A. 1977. Generating project networks. In International Joint Conference on Artificial Intelligence. IJCAI
  19. [Tate, 1996] Tate, A. 1996. Representing plans as a set of constraints -the <i-n-ova> model. In Drabble, B., ed., Proc. Third International Conference on Artificial Intelli- gence Planning Systems. University of Edinburgh: AAAI Press. Available as Pointer.
  20. [Tissot & Gruninger, 1999] Tissot, F., & Gruninger, M. NIST process specification language. Technical report, NIST.
  21. [Wallace et al., 1996] Wallace, D., Ippolito, L. & Cuthill B. Reference information for the software verification and validation Process. In NIST Special Publication 500-234, 1996.
  22. [Wilkins, 1988] Wilkins, D. E. 1988. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann. [Yang, 1990]
  23. Yang, Q. 1990. Formalizing planning knowl- edge for hierarchical planning. Computational Intelli- gence 6(1):12-24.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards