Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2019: Logic Programming and Nonmonotonic Reasoning pp 148–162Cite as

Towards Dynamic Answer Set Programming over Finite Traces

  • Conference paper
  • First Online:

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

Abstract

Our ultimate goal is to conceive an extension of Answer Set Programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To address this in a semantically well founded way, we generalize the definition of Dynamic Equilibrium Logic to accommodate finite linear time and extend it with a converse operator in order to capture past temporal operators. This results in a general logical framework integrating existing dynamic and temporal logics of Here-and-There over both finite and infinite time. In the context of finite time, we then develop a translation of dynamic formulas into propositional ones that can in turn be translated into logic programs.

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

Notes

  1. 1.

    The same consideration led to GOLOG [12] in the context of the situation calculus.

References

  1. Aguado, F., Cabalar, P., Diéguez, M., Pérez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Class. Log. 23(1–2), 2–24 (2013)

    Article  MathSciNet  Google Scholar 

  2. Aguado, F., Cabalar, P., Diéguez, M., Pérez, G., Vidal, C.: Temporal equilibrium logic with past operators. J. Appl. Non-Class. Log. 27(3–4), 161–277 (2017)

    Article  MathSciNet  Google Scholar 

  3. Aguado, F., Pérez, G., Vidal, C.: Integrating temporal extensions of answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 23–35. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40564-8_3

    Chapter  MATH  Google Scholar 

  4. Bosser, A., Cabalar, P., Diéguez, M., Schaub, T.: Introducing temporal stable models for linear dynamic logic. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, pp. 12–21. AAAI Press (2018)

    Google Scholar 

  5. Cabalar, P., Kaminski, R., Schaub, T., Schuhmann, A.: Temporal answer set programming on finite traces. Theor. Pract. Log. Program. 18(3–4), 406–420 (2018)

    Article  MathSciNet  Google Scholar 

  6. Cabalar, P., Pearce, D., Valverde, A.: Reducing propositional theories in equilibrium logic to logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 4–17. Springer, Heidelberg (2005). https://doi.org/10.1007/11595014_2

    Chapter  Google Scholar 

  7. De Giacomo, G., Vardi, M.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the International Joint Conference on AI, pp. 854–860. IJCAI/AAAI Press (2013)

    Google Scholar 

  8. Giordano, L., Martelli, A., Dupré, D.T.: Reasoning about actions with temporal answer sets. Theor. Pract. Log. Program. 13(2), 201–225 (2013)

    Article  MathSciNet  Google Scholar 

  9. Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press, Cambridge (2000)

    Book  Google Scholar 

  10. Henriksen, J., Thiagarajan, P.: Dynamic linear time temporal logic. Ann. Pure Appl. Log. 96(1–3), 187–207 (1999)

    Article  MathSciNet  Google Scholar 

  11. Heyting, A.: Die formalen Regeln der intuitionistischen Logik. In: Sitzungsberichte der Preussischen Akademie der Wissenschaften, p. 42–56. (1930)

    Google Scholar 

  12. Levesque, H., Reiter, R., Lespérance, Y., Lin, F., Scherl, R.: GOLOG: a logic programming language for dynamic domains. J. Log. Program. 31(1–3), 59–83 (1997)

    Article  MathSciNet  Google Scholar 

  13. Lifschitz, V.: Answer set planning. In: Proceedings of the International Conference on Logic Programming, pp. 23–37. MIT Press (1999)

    Google Scholar 

  14. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transact. Comput. Log. 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  15. Pnueli, A.: The temporal logic of programs. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 46–57. IEEE Computer Society Press (1977)

    Google Scholar 

  16. Pratt, V.: Semantical consideration on Floyd-Hoare logic. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 109–121. IEEE Computer Society Press (1976)

    Google Scholar 

  17. Ryan, M.: Efficiently implementing GOLOG with answer set programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 2352–2357. AAAI Press (2014)

    Google Scholar 

  18. Son, T., Baral, C., Nam, T., McIlraith, S.: Domain-dependent knowledge in answer set planning. ACM Transact. Comput. Log. 7(4), 613–657 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was partially supported by MINECO, Spain, (grant TIC2017-84453-P), Xunta de Galicia, Spain, (grant 2016–2019 ED431G/01, CITIC), ANR, France, (grant ANR-16-ASMA-0002) and DFG, Germany, (grant SCHA 550/9).

Author information

Authors and Affiliations

  1. ENIB, Brest, France

    Martín Diéguez

  2. University of Corunna, A Coruña, Spain

    Pedro Cabalar

  3. University of Potsdam, Potsdam, Germany

    Torsten Schaub

  4. Simon Fraser University, Burnaby, Canada

    Torsten Schaub

  5. Griffith University, Brisbane, Australia

    Torsten Schaub

Authors
  1. Pedro Cabalar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martín Diéguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Torsten Schaub .

Editor information

Editors and Affiliations

  1. Saint Joseph's University, Philadelphia, PA, USA

    Marcello Balduccini

  2. University of Nebraska at Omaha, Omaha, USA

    Yuliya Lierler

  3. TU Wien, Vienna, Austria

    Stefan Woltran

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cabalar, P., Diéguez, M., Schaub, T. (2019). Towards Dynamic Answer Set Programming over Finite Traces. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20528-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20527-0

  • Online ISBN: 978-3-030-20528-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation