Skip to main content
SpringerLink
Log in
Book cover

European Workshop on Logics in Artificial Intelligence

JELIA 2008: Logics in Artificial Intelligence pp 8–20Cite as

Strongly Equivalent Temporal Logic Programs

  • Conference paper

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

Abstract

This paper analyses the idea of strong equivalence for transition systems represented as logic programs under the Answer Set Programming (ASP) paradigm. To check strong equivalence, we use a linear temporal extension of Equilibrium Logic (a logical characterisation of ASP) and its monotonic basis, the intermediate logic of Here-and-There (HT). Trivially, equivalence in this temporal extension of HT provides a sufficient condition for temporal strong equivalence and, as we show in the paper, it can be transformed into a provability test into the standard Linear Temporal Logic (LTL), something that can be automatically checked using any of the LTL available provers. The paper shows an example of the potential utility of this method by detecting some redundant rules in a simple actions reasoning scenario.

This research is partially supported by Spanish Ministry MEC, research project TIN-15455-C03-02.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 169–181. Springer, Heidelberg (1999)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming: Proc.of the Fifth International Conference and Symposium, vol. 2, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  4. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving, pp. 285–316. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  5. Gelfond, M.: Answer Sets. In: Handbook of Knowledge Representation, pp. 285–316. Elsevier, Amsterdam (2007)

    Google Scholar 

  6. WASP: ASP solvers web page (last update, 2005), http://dit.unitn.it/~wasp/Solvers/index.html

  7. Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  9. Pearce, D., Valverde, A.: Towards a first order equilibrium logic for nonmonotonic reasoning. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 147–160. Springer, Heidelberg (2004)

    Google Scholar 

  10. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 372–379 (2004)

    Google Scholar 

  11. McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence Journal 4, 463–512 (1969)

    MATH  Google Scholar 

  12. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence Journal 153, 49–104 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ferraris, P.: Causal theories as logic programs. In: Proc. of the 20th Workshop on Logic Programming (WLP 2006) (2006)

    Google Scholar 

  14. Gelfond, M., Lifschitz, V.: Action languages. Linköping Electronic Articles in Computer and Information Science 3(16) (1998)

    Google Scholar 

  15. Eiter, T., Faber, W., Traxler, P.: Testing strong equivalence of datalog programs - implementation and examples. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 437–441. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Cabalar, P.: QHT - a prover for quantified here and there (2008), http://www.dc.fi.udc.es/~cabalar/eqwb.html

  17. Lifschitz, V., Pearce, D., Valverde, A.: A characterization of strong equivalence for logic programs with variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, 42–56 (1930)

    Google Scholar 

  19. Cabalar, P., Vega, G.P.: Temporal equilibrium logic: a first approach. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 241–248. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Kamp, J.A.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles (1968)

    Google Scholar 

  21. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  22. Pearce, D., Tompits, H., Woltran, S.: Encodings of equilibrium logic and logic programs with nested expressions. In: Bradzil, P., Jorge, A. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 306–320. Springer, Heidelberg (2001)

    Google Scholar 

  23. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Bradzil, P., Jorge, A. (eds.) Proc. of the 8th Intl. Conf. on Principles and Knowledge Representation and Reasoning (KR 2002), pp. 170–176. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  24. Heuerding, A., Jäger, G., Schwendimann, S., Seyfried, M.: A logics workbench. AI Communications 9(2), 53–58 (1996)

    Google Scholar 

  25. Thielscher, M.: Ramification and causality. Artificial Intelligence Journal 89(1–2), 317–364 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  26. Valverde, A.: tabeql: A tableau based suite for equilibrium logic. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 734–737. Springer, Heidelberg (2004)

    Google Scholar 

  27. Chen, Y., Lin, F., Li, L.: SELP - a system for studying strong equivalence between logic programs. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 442–446. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computación, Corunna University, Spain

    Felicidad Aguado, Pedro Cabalar, Gilberto Pérez & Concepción Vidal

Authors
  1. Felicidad Aguado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Cabalar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gilberto Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Concepción Vidal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, TU Dresden, Germany

    Steffen Hölldobler

  2. Institut für Theoretische Informatik, TU Dresden, Germany

    Carsten Lutz

  3. Institute of Philosophy, Dresden University of Technology, Dresden, Germany

    Heinrich Wansing

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aguado, F., Cabalar, P., Pérez, G., Vidal, C. (2008). Strongly Equivalent Temporal Logic Programs. In: Hölldobler, S., Lutz, C., Wansing, H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science(), vol 5293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87803-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87803-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87802-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation