Skip to main content

On the Use of Operation Information in Problem Solving

  • Chapter
GWAI-83

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 76))

  • 61 Accesses

Abstract

In this paper I present ideas, results and problems of operational problem solving, i.e. problem solving mainly regarding information about the operations involved, and disregarding world states nearly completely. As a demonstration of the concept’s usefulness, the program BOPS (Bonn Operational Problem Solver) is presented. Its goals are specified not by a conjunction of predicates that has to hold, but by a set of operation instances that have to be applied. Situations are characterized by the operation sequence they have been produced by, where inverse operations are recognized and deleted, thereby excluding detours and avoiding problems of subgoal protection. Stating operation preconditions in terms of operation instances already applied restricts access to world states to a minimum and facilitates goal directedness in planning.

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

Access this chapter

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. Fikes, R./P. Hart/N. Nilsson: Learning and Executing Generalized Robot Plans; in: Artificial Intelligence, 3 (1972), pp 251–288

    Article  Google Scholar 

  2. Hertzberg, J.: Problemlösen mit Piaget-Operationen; Universität Bonn, Informatik-Bericht Nr.38, 1982

    Google Scholar 

  3. Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems; in: J. ACM, 27 (1980), pp 797–821

    Article  MathSciNet  MATH  Google Scholar 

  4. Sacerdoti, E.D.: Planning in a Hierarchy of Abstraction Spaces; in: Artificial Intelligence, 5 (1974), pp 115–135

    Article  MATH  Google Scholar 

  5. Sacerdoti, E.D.: A Structure for Plans and Behavior; New York, 1977

    MATH  Google Scholar 

  6. Siekmann, J./P. Szabo: Universal Unification; in: Wahlster, W. (ed.): GWAI-82; Berlin etc. (Springer Informatik-Fachberichte 58), pp 102–141

    Google Scholar 

  7. Tate, A.: Interacting Goals and their Use; Proc. IJCAI-4, 1975, pp 215–218

    Google Scholar 

  8. Waldinger, R.: Achieving Several Goals Simultaneously; in: Machine Intelligence 8, 1977, pp 94–136

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hertzberg, J. (1983). On the Use of Operation Information in Problem Solving. In: Neumann, B. (eds) GWAI-83. Informatik-Fachberichte, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69391-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69391-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12871-7

  • Online ISBN: 978-3-642-69391-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics