Skip to main content

Solving the Qualification Problem (In the Presence of the Frame Problem)

  • Conference paper
  • First Online:

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

Abstract

We present a uniform nonmonotonic solution for the problem of reasoning about action on the basis of argumentation-theoretic approach in a series of paper. This paper is the first one in which we solve the frame and the qualification problems in a simplifying setting without domain constraints or ramifications. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic.

fluent is a technical term referring to functions or predicates whose values can be varied relative to time.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Baker. A Simple Solution to the Yale Shooting Problem. In KR’89: 11–20.

    Google Scholar 

  2. A. Bondarenko, P. Dung, R. Kowalski, and F. Toni. An Abstract, Argumentation-Theoretic Approach to Default Reasoning. AIJ, 93: 63–101, 1997.

    MATH  MathSciNet  Google Scholar 

  3. M. Castilho, O. Gasquet and A. Herzig. Formalizing action and change in modal logic I: the frame problem. Journal of Logic and Computation, to appear.

    Google Scholar 

  4. T. Drakengren and M. Bjäreland. Reasoning about action in polynomial time. AIJ, 115: 1–24, 1999.

    MATH  Google Scholar 

  5. J. Kvarnström and P. Doherty. Tackling the Qualification Problem Using Fluent Dependency Constraints. Computational Intelligence, 16(2): 169–209 (2000).

    Article  MathSciNet  Google Scholar 

  6. Foo, N., Peppas, P., Vo, B.Q. and Zhang, D. Circumscriptive Models and Automata. Proc. of NRAC, IJCAI-01: 1–7, Seattle, Sept 2001.

    Google Scholar 

  7. M. Ginsberg, D. Smith. Reasoning About Action II: The Qualification Problem. AIJ, 35(3): 311–342 (1988).

    MATH  MathSciNet  Google Scholar 

  8. M. Gelfond and V. Lifschitz. Action languages. Electronic Trans. on AI, 3(16), 1998.

    Google Scholar 

  9. S. Hanks, and D. McDermott. Nonmonotonic logic and temporal projection. AIJ, 33(3): 379–412, 1987.

    MATH  MathSciNet  Google Scholar 

  10. N. Kushmerick. Cognitivism ans situated action: two views on intelligence agency. Computers and Artificial Intelligence, 15(5): 1–20, 1996.

    Google Scholar 

  11. F. Lin and R. Reiter. State Constraints Revisited. Journal of Logic and Computation, 4(5): 655–678 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  12. F. Lin and Y. Shoham. Provably Correct Theories of Action. JACM, 42(2): 293–320, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. McCarthy. Epistemological Problems of Artificial Intelligence. In Proc. of the IJCAI, 1977: 555–562.

    Google Scholar 

  14. J. McCarthy. Applications of Circumscription to Formalizing Common-Sense Knowledge. AIJ, 28(1): 89–116 (1986).

    MathSciNet  Google Scholar 

  15. J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, v.4, 1969: 463–502.

    MATH  Google Scholar 

  16. R. Reiter. The frame problem in the situation calculus: A simple solution. In V. Lifschitz, ed., AI and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp.418–420. Academic Press, 1991.

    Google Scholar 

  17. R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, 2001.

    Google Scholar 

  18. E. Sandewall. Features and Fluents. Oxford University Press, 1994.

    Google Scholar 

  19. M. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. The MIT Press, Cambridge, Massachusetts, 1997.

    Google Scholar 

  20. M. Thielscher. Ramification and Causality. AIJ, 89(1–2): 317–364 (1997).

    MATH  MathSciNet  Google Scholar 

  21. M. Thielscher. The Qualification Problem: A solution to the problem of anomalous models. AIJ, 131(1–2): 1–37 (2001).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vo, Q.B., Foo, N.Y. (2001). Solving the Qualification Problem (In the Presence of the Frame Problem). In: Stumptner, M., Corbett, D., Brooks, M. (eds) AI 2001: Advances in Artificial Intelligence. AI 2001. Lecture Notes in Computer Science(), vol 2256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45656-2_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45656-2_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics