Skip to main content
SpringerLink
Log in

Reasoning about Actions in Prioritized Default Theory

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2002)

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

Included in the following conference series:

Abstract

This paper shows how action theory in the language B can be naturally encoded using prioritized default theory. We also show how prioritized default theory can be extended to express preferences between rules and formulae. This extension provides a natural framework to introduce preferences over trajectories in B. We illustrate how these preferences can be expressed and how they can be represented within extended prioritized default theory. We also discuss how this framework can be implemented in terms of answer set programming.

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. F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1,2):123–191, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Fikes and N. Nilson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3–4):189–208, 1971.

    Article  MATH  Google Scholar 

  3. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. In ILPS, MIT Press, 1988.

    Google Scholar 

  4. M. Gelfond and V. Lifschitz. Action languages. ETAI, 3(6), 1998.

    Google Scholar 

  5. M. Gelfond and T.C. Son. Prioritized default theory. In Selected Papers from the Workshop on Logic Programming and Knowledge Representation, pages 164–223. Springer, 1998.

    Google Scholar 

  6. M. Ginsberg and D. Smith. Reasoning about actions I. Artificial Intelligence, 35, 1988.

    Google Scholar 

  7. R. Kowalski and M. Sergot. A logic-based calculus of events. NGC, 4:67–95, 1986.

    Google Scholar 

  8. V. Lifschitz. Answer set planning. In Int. Conf. Logic Programming, pages 23–37, 1999.

    Google Scholar 

  9. V. Lifschitz and H. Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh International Conf. on Logic Programming, pages 23–38, 1994.

    Google Scholar 

  10. V. Lifschitz and H. Turner. Representing transition systems by logic programs. In Proceedings Int. Conf. on Logic Programming and Nonmonotonic Reasoning, pages 92–106, 1999.

    Google Scholar 

  11. J. McCarthy. Epistemological problems of artificial intelligence. In Proceedings Int. Joint Conference on Artificial Intelligence, pages 1038–1044. 1977.

    Google Scholar 

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

    MATH  Google Scholar 

  13. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  14. I. Niemelä and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Procs. LPNMR, pages 420–429, 1997.

    Google Scholar 

  15. E. Pednault. ADLand the state-transition model of actions. Journal of Logic and Computation, 4(5):467–513, October 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. E. Pontelli, G. Gupta, D. Ranjan, and B. Milligan. A Domain Specific Language for Solving Philogenetic Inference Problems. TR-CS-001/2002, New Mexico State University, 2002.

    Google Scholar 

  17. E. Pontelli and T. Son. Navigating HTML Tables: Planning, Reasoning, and Agents. In Int. Conference on Assistive Technologies. ACM Press, 2002.

    Google Scholar 

  18. T.C. Son, C. Baral, and S. McIlraith. Domain dependent knowledge in planning-an answer set planning approach. In Procs. LPNMR, pages 226–239, Vienna, 2001.

    Google Scholar 

  19. T.C. Son and E. Pontelli. Reasoning About Actions in Prioritized Default Theory. TR-CS-002/002, New Mexico State U., 2002.

    Google Scholar 

  20. H. Turner. Representing actions in logic programs and default theories. Journal of Logic Programming, 31(1–3):245–298, May 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, New Mexico State University, New Mexico

    Tran Cao Son & Enrico Pontelli

Authors
  1. Tran Cao Son
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrico Pontelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS, University of Calabria, P.te P. Bucci, Cubo 41C, 87036, Rende, CS, Italy

    Sergio Flesca  & Sergio Greco  & 

  2. Department of Mathematics, University of Calabria, P.te P. Bucci, Cubo 30B, 87036, Rende, CS, Italy

    Giovambattista Ianni  & Nicola Leone  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Son, T.C., Pontelli, E. (2002). Reasoning about Actions in Prioritized Default Theory. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45757-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44190-8

  • Online ISBN: 978-3-540-45757-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation