Abstract
To solve a problem with intelligent planning, an expert has to try his best to write a planning domain. It is hard and time-wasting. Considering software requirement as a problem to be solved by intelligent planning, it’s even more difficult to write the domain, because of software requirement’s feature, for instance, changeability. To reduce the difficulty, we divide the work into two tasks: one is to describe an incomplete domain of software requirement with PDDL(Level 1,Strips) [11]; the other is to complete the domain by learning from plan samples based on business processes. We design a learning tool (Learning Action Model from Plan Samples, LAMPS) to complete the second task. In this way, what an expert needs to do is to do the first task and give some plan samples. In the end, we offer some experiment result analysis and conclusion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yang, Q., Wu, K., Jiang, Y.: Learning Action Models from Plan Examples with Incomplete Knowledge. In: ICAPS 2005. Proceedings of the 2005 International Conference on Automated Planning and Scheduling, Monterey, CA USA, pp. 241–250 (June 2005)
Benson, S.: Inductive Learning of Reactive Action Models. In: Proceedings of the International Conference on Machine Learning (ICML, Stanford University, Stanford, CA, pp. 47–54 (1995)
Blythe, J., Kim, J., Ramachandran, S., Gil, Y.: An Integrated Environment for Knowledge Acquisition. In: Proceedings of the International Conference on Intelligent User Interfaces (IUI2001), Santa Fe, NM, pp. 13–20 (2001)
Gil, Y.: Learning by Experimentation: Incremental Refinement of Incomplete Planning Domains. In: Eleventh Intl. Conf. on Machine Learning, pp. 87–95 (1994)
Oates, T., Cohen, P.R.:Searching for Planning Operators with Context-dependent and Probabilistic Effects. In: Proceedings of the Thirteenth National Conference on AI (AAAI 1996), Portland, OR, pp. 865–C868 (1996)
Sablon, G., Boulanger, D.: Using the Event Calculus to Integrate Planning and Learning in an Intelligent Autonomous Agent, Current Trends in AI Planning, pp. 254–265. IOS Press, Amsterdam (1994)
Shen, W.: Autonomous Learning from the Environment, Computer Science Press/W.H. Freeman and Company (1994)
Wang, X.: Learning by Observation and Practice: An Incremental Approach for Planning Operator Acquisition. In: ICML 1995. Proceedings of the Twelfth International Conference on Machine Learning, pp. 549–557 (1995)
Sommerville, I.: Software Engineering[M]. Addison- Wesley [s.l.], Reading (2000)
Wan, H., Zheng, Y., Li, L.: Software Requirement Specification based on Answer Sets Semantics and Subject-Predicate-Object. In: ICYCS’ 05. The 8th International Conference for Young Computer Scientists, Beijing, China, pp. 20-22 (September 2005)
Fox, M., Long, D.: PDDL2.1: An Extension to pddl for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research 20, 61–C124 (2003)
Borchers, B., Furman, J.: A two-phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. Journal of Combinatorial Optimization 2(4), 299–C306 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhuo, H., Li, L., Bian, R., Wan, H. (2007). Requirement Specification Based on Action Model Learning. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)