Skip to main content
SpringerLink
Log in
Book cover

Annual Conference on Artificial Intelligence

KI 2001: KI 2001: Advances in Artificial Intelligence pp 290–304Cite as

Addressing the Qualification Problem in FLUX

  • Conference paper
  • First Online:

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

Abstract

The Qualification Problem arises for planning agents in realworld environments, where unexpected circumstances may at any time prevent the successful performance of an action. We present a logic programming method to cope with the Qualification Problem in the action programming language Flux, which builds on the Fluent Calculus as a solution to the fundamental Frame Problem. Our system allows to plan under the default assumption that actions succeed as they normally do, and to reason about these assumptions in order to recover from unexpected action failures.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Gerhard Brewka. Adding priorities and specificity to default logic. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Proc. of the European Workshop on Logics in AI (JELIA), volume 838 of LNAI, pages 247–260, York, UK, September 1994. Springer.

    Google Scholar 

  2. Patrick Doherty, Joakim Gustafsson, Lars Karlsson, and Jonas Kvarnström. Temporal action logics (TAL): Language specification and tutorial. Electronic Transactions on Artificial Intelligence, 2(3-4):273–306, 1998. http://www.ep.liu.se/ ea/cis/1998/015/.

    MathSciNet  Google Scholar 

  3. Richard E. Fikes and Nils J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189–208, 1971.

    Article  MATH  Google Scholar 

  4. Thom Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1-3):95–138, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. Giuseppe De Giacomo, Ray Reiter, and Mikhail Soutchanski. Execution monitoring of high-level robot programs. In Cohn, Schubert, and Shapiro, editors, Proc. of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 453–464, Trento, Italy, June 1998.

    Google Scholar 

  6. Hector Levesque and Maurice Pagnucco. Legolog: Inexpensive experiments in cognitive robotics. In Cognitive Robotics Workshop at ECAI, pages 104–109, Berlin, Germany, August 2000.

    Google Scholar 

  7. Hector Levesque, Fiora Pirri, and Ray Reiter. Foundations for a calculus of situations. Electronic Transactions on Artificial Intelligence, 3(1-2):159–178, 1998. http://www.ep.liu.se/ea/cis/1998/018/.

    MathSciNet  Google Scholar 

  8. Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, and Richard B. Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31(1-3):59–83, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  9. Vladimir Lifschitz. Formal theories of action (preliminary report). In J. McDermott, editor, Proc. of IJCAI, pages 966–972, Milan, Italy, August 1987. Morgan Kaufmann.

    Google Scholar 

  10. John W. Lloyd. Foundations of Logic Programming. Series Symbolic Computation. Springer, second, extended edition, 1987.

    Google Scholar 

  11. Yves Martin. Solving the Qualification Problem in FLUX. Master’s thesis, TU Dresden, Germany, March 2001. http://www.cl.inf.tu-dresden.de/~yves.

  12. Norman McCain and Hudson Turner. Satisfiability planning with causal theories. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Proc. of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 212–223, Trento, Italy, June 1998. Morgan Kaufmann.

    Google Scholar 

  13. John McCarthy. Epistemological problems of artificial intelligence. In Proc. of IJCAI, pages 1038–1044, Cambridge, MA, 1977. MIT Press.

    Google Scholar 

  14. John McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89–116, 1986.

    Article  MathSciNet  Google Scholar 

  15. Ray Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  16. Murray Shanahan. Event calculus planning revisited. In Proc. of the European Conference on Planning (ECP), volume 1348 of LNAI, pages 390–402. Springer, 1997.

    Google Scholar 

  17. Michael Thielscher. Ramification and causality. Artificial Intelligence, 89(1-2):317–364, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  18. Michael Thielscher. Introduction to the Fluent Calculus. Electronic Transactions on Artificial Intelligence, 2(3-4):179–192, 1998. http://www.ep.liu.se/ea/ cis/1998/014/.

    MathSciNet  Google Scholar 

  19. Michael Thielscher. From Situation Calculus to Fluent Calculus: State update axioms as a solution to the inferential frame problem. Artificial Intelligence, 111(1-2):277–299, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  20. Michael Thielscher. The fluent calculus: A specification language for robots with sensors in nondeterministic, concurrent, and ramifying environments. Technical Report CL-2000-01, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, 2000.

    Google Scholar 

  21. Michael Thielscher. The qualification problem: A solution to the problem of anomalous models. Artificial Intelligence, 2001.

    Google Scholar 

Download references

Authors
  1. Yves Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Thielscher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, Theoretical Computer Science, Ahornstrasse 55, 52074, Aachen, Germany

    Franz Baader

  2. Intelligent Systems Department, University of Leipzig, Computer Science Institute, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Institute of Information Systems Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstrasse 11, 1040, Wien, Austria

    Thomas Eiter

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, Y., Thielscher, M. (2001). Addressing the Qualification Problem in FLUX. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45422-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation