Skip to main content
SpringerLink
Log in

Component-Oriented Programming as an AI-Planning Problem

  • Conference paper
  • First Online:
Developments in Applied Artificial Intelligence (IEA/AIE 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2358))

Abstract

A dream of the software-engineering discipline is to develop reusable program-components and to build programs out of them. Formalization of a type of component-oriented programming (COP) problem (that does not need any non-trivial effort for gluing components together) shows a surprising similarity to the problem of Planning as defined within the Artificial Intelligence (AI). This short paper explores the possibility of solving the COP by using AI-planning techniques. We have looked into some closely related AI-planning algorithms and suggested directions on how to adopt them for the purpose. Other important related issues like the target specification languages and other relevant research disciplines are also being touched upon here.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, A. V., and Furst, M. L.: Fast planning through planning graph analysis. Artificial Intelligence journal, (1997) 90, pp. 281–300.

    Article  MATH  Google Scholar 

  2. Bhansali, S. and Hoar, T.H.: Automated software synthesis: An application in mechanical CAD. IEEE Transactions on Software Engineering, (1998) 24(10).

    Google Scholar 

  3. Do, M. B., and Kambhampati, S.: Planning as constraint satisfaction: Solving the planning by compiling it into CSP. Artificial Intelligence journal, (2001) 132, No. 2, pp. 151–182.

    Article  MATH  MathSciNet  Google Scholar 

  4. Kvarnstrom, J., and Doherty, P.: TAL planner: A temporal action logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence journal (2001).

    Google Scholar 

  5. Mitra, D.: Interactive modeling for batch simulation of engineering systems: A constraint satisfaction problem. Lecture Notes in Artificial Intelligence (Proceedings of the IEA/AIE-2001), (2001) 2070, pp. 602–611, Springer.

    Google Scholar 

  6. Memon, A. M., Martha, E. P., and Soffa, M. L.: Plan generation for GUI testing. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS-2000), pp. 226–235, Breckenridge, Colorado, USA.

    Google Scholar 

  7. Paul, S. and Prakash, A.: A query algebra for program databases. IEEE Transactions on Software Engineering, (1996) 22(3).

    Google Scholar 

  8. Rumbaugh, J., Jacobson, I., and Booch, G.: The Unified Modeling Language Reference Manual. Addison-Wesley, Reading, Massachusetts (1999).

    Google Scholar 

  9. Russell, S. and Norvig, P.. Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, New Jersey (1995).

    MATH  Google Scholar 

  10. Shaw, M., and Garlan, D.: Software Architecture: Perspectives on an Emerging Discipline. Printice-Hall, Inc., New Jersey, USA (1996)..

    MATH  Google Scholar 

  11. Tate, A.: Representing plans as a set of constraints — the <I-N-OVA> model. Proceedings of the AIPS-96 conference, Edinburgh, UK (1996).

    Google Scholar 

  12. Weld, D.: An introduction to partial-order planning. AI Magazine, AAAI Press (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Florida Institute of Technology, Melbourne, Florida, USA

    Debasis Mitra & Walter P. Bond

Authors
  1. Debasis Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter P. Bond
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Intelligent Systems and Complex Processes, Swinburne University of Technology, John Street, Hawthorn, Victoria, Australia, 3122

    Tim Hendtlass

  2. Department of Computer Science, Southwest Texas State University, 601 University Drive, San Marcos, TX, 78666, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitra, D., Bond, W.P. (2002). Component-Oriented Programming as an AI-Planning Problem. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-48035-8_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43781-9

  • Online ISBN: 978-3-540-48035-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation