Skip to main content
SpringerLink
Log in

A Formal Study on the Dualities in Temporal Projection Problems

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2012)

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

Included in the following conference series:

  • 1794 Accesses

Abstract

Using Situation Calculus, this paper provides a formal account of the relationship between the possible truth problem and the necessary truth problem in dynamical systems. In addition, advantages of applying this formal method to the domain are demonstrated through examples.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bresina, J.L., Jónsson, A.K., Morris, P.H., Rajan, K.: Activity planning for the Mars exploration rovers. In: ICAPS 2005, pp. 40–49 (2005)

    Google Scholar 

  2. Dean, T., Boddy, M.: Reasoning about partially ordered events. Artificial Intelligence 36(3), 375–399 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garey, M., Johnson, D.: Computers and intractability - a guide to NP-completeness. W.H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  4. Kambhampati, S., Nau, D.: On the nature and role of modal truth criteria in planning. Artificial Intelligence 82(1-2), 129–155 (1996)

    Article  MathSciNet  Google Scholar 

  5. Muise, C.J., McIlraith, S.A., Beck, J.C.: Monitoring the execution of partial-order plans via regression. In: IJCAI 2011, pp. 1975–1982 (2011)

    Google Scholar 

  6. Nebel, B., Bäckström, C.: On the computational complexity of temporal projection, planning, and plan validation. Artificial Intelligence 66(1), 125–160 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Reiter, R.: Knowledge in action: logical foundations for specifying and implementing dynamical systems. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  8. Tan, X.: The Application of Ontologies to Reasoning with Process Modeling Formalisms. PhD thesis, University of Toronto (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Technology in Government, University at Albany/SUNY, USA

    Xing Tan

Authors
  1. Xing Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Computer Science, Department of Computer Science and Software Engineering, Concordia University, H3G 1M8, Montreal, QC, Canada

    Leila Kosseim

  2. Faculty of Engineering, School of Electrical Engineering and Computer Science, University of Ottawa, K1N 6N5, Ottawa, ON, Canada

    Diana Inkpen

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, X. (2012). A Formal Study on the Dualities in Temporal Projection Problems. In: Kosseim, L., Inkpen, D. (eds) Advances in Artificial Intelligence. Canadian AI 2012. Lecture Notes in Computer Science(), vol 7310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30353-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30353-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30352-4

  • Online ISBN: 978-3-642-30353-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation