Skip to main content

Non-monotonic Temporal Goals

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)

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

Abstract

In this paper we introduce a logic programming based framework which allows the representation of conditional non-monotonic temporal beliefs and goals in a declarative way. We endow it with stable model like semantics that allows us to deal with conflicting goals and generate possible alternatives. We show that our framework satisfies some usual properties on goals and that it allows imposing alternative constraints on the interaction between beliefs and goals. We prove the decidability of the usual reasoning tasks and show how they can be implemented using an ASP solver and an LTL reasoner in a modular way, thus taking advantage of existing LTL reasoners and ASP solvers.

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 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. Alferes, J.J., Banti, F., Brogi, A., Leite, J.A.: The refined extension principle for semantics of dynamic logic programming. Studia Logica 79(1), 7–32 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baral, C., Zhao, J.: Non-monotonic temporal logics for goal specification. In: Veloso, M.M. (ed.) IJCAI, pp. 236–242 (2007)

    Google Scholar 

  3. Bordini, R.H., Hübner, J.F., Wooldridge, M.: Programming multi-agent systems in AgentSpeak using Jason. Wiley-Interscience (2007)

    Google Scholar 

  4. Bratman, M.: Intention, plans, and practical reason. Harvard University Press, Cambridge (1987)

    Google Scholar 

  5. Cohen, P.R., Levesque, H.J.: Intention is choice with commitment. Artif. Intell. 42(2-3), 213–261 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dastani, M.: 2APL: a practical agent programming language. Autonomous Agents and Multi-Agent Systems 16(3), 214–248 (2008)

    Article  Google Scholar 

  7. Dastani, M., van Riemsdijk, M.B., Winikoff, M.: Rich goal types in agent programming. In: Sonenberg, L., Stone, P., Tumer, K., Yolum, P. (eds.) AAMAS, pp. 405–412. IFAAMAS (2011)

    Google Scholar 

  8. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3-4), 365–385 (1991)

    Article  Google Scholar 

  9. Gonçalves, R., Alferes, J.J.: Parametrized logic programming. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 182–194. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Hindriks, K.V., van der Hoek, W., van Riemsdijk, M.B.: Agent programming with temporally extended goals. In: Sierra, C., Castelfranchi, C., Decker, K.S., Sichman, J.S. (eds.) AAMAS (1), pp. 137–144. IFAAMAS (2009)

    Google Scholar 

  11. Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), pp. 46–57. IEEE Comput. Sci., Long Beach (1977)

    Chapter  Google Scholar 

  12. Rao, A.S., Georgeff, M.P.: Modeling rational agents within a BDI-architecture. In: Allen, J.F., Fikes, R., Sandewall, E. (eds.) KR, pp. 473–484. Morgan Kaufmann (1991)

    Google Scholar 

  13. Rao, A.S., Georgeff, M.P.: BDI agents: From theory to practice. In: Lesser, V.R., Gasser, L. (eds.) ICMAS, pp. 312–319. The MIT Press (1995)

    Google Scholar 

  14. Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1-2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. van Riemsdijk, M.B., Dastani, M., Meyer, J.J.C.: Goals in conflict: semantic foundations of goals in agent programming. Autonomous Agents and Multi-Agent Systems 18(3), 471–500 (2009)

    Article  Google Scholar 

  16. van Riemsdijk, M.B., Dastani, M., Winikoff, M.: Goals in agent systems: a unifying framework. In: Padgham, L., Parkes, D.C., Müller, J.P., Parsons, S. (eds.) AAMAS (2), pp. 713–720. IFAAMAS (2008)

    Google Scholar 

  17. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. Winikoff, M., Padgham, L., Harland, J., Thangarajah, J.: Declarative & procedural goals in intelligent agent systems. In: Fensel, D., Giunchiglia, F., McGuinness, D.L., Williams, M.A. (eds.) KR, pp. 470–481. Morgan Kaufmann (2002)

    Google Scholar 

  19. Wójcicki, R.: Theory of Logical Calculi. Synthese Library. Kluwer Academic Publishers (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonçalves, R., Knorr, M., Leite, J., Slota, M. (2013). Non-monotonic Temporal Goals. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40564-8_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40563-1

  • Online ISBN: 978-3-642-40564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics