Skip to main content
SpringerLink
Log in

Verifying Strong Equivalence of Programs in the Input Language of gringo

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2019)

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

Abstract

The semantics of the input language of the ASP grounder gringo uses a translation that converts a logic program, which may contain variables and arithmetic operations, into a set of infinitary propositional formulas. In this note, we show that the result of that translation can be replaced in some cases by a finite set of first-order sentences. The translator anthem constructs that set of sentences and converts it to a format that can be processed by automated reasoning tools. anthem, in combination with the first-order theorem prover vampire, allows us to verify the strong equivalence of programs in the language of gringo.

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

Institutional subscriptions

Notes

  1. 1.

    https://github.com/potassco/anthem.

References

  1. Chen, Y., Lin, F., Li, L.: SELP—a system for studying strong equivalence between logic programs. In: Proceedings of LPNMR, pp. 442–446 (2005)

    Chapter  Google Scholar 

  2. Ferraris, P.: Answer sets for propositional theories. In: Proceedings of LPNMR, pp. 119–131 (2005)

    Chapter  Google Scholar 

  3. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract Gringo. TPLP 15(4–5), 449–463 (2015)

    MathSciNet  MATH  Google Scholar 

  4. Harrison, A., Lifschitz, V., Pearce, D., Valverde, A.: Infinitary equilibrium logic and strongly equivalent logic programs. Artif. Intell. 246, 22–33 (2017)

    Article  MathSciNet  Google Scholar 

  5. Harrison, A., Lifschitz, V., Raju, D.: Program completion in the input language of GRINGO. TPLP 17(5–6), 855–871 (2017)

    MathSciNet  MATH  Google Scholar 

  6. Janhunen, T., Oikarinen, E.: LPEQ and DLPEQ—translators for automated equivalence testing of logic programs. In: Proceedings of LPNMR, pp. 336–340 (2004)

    Chapter  Google Scholar 

  7. Kovács, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1–35. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39799-8_1

    Chapter  Google Scholar 

  8. Lifschitz, V., Lühne, P., Schaub, T.: anthem: Transforming gringo programs into first-order theories (preliminary report). In: Proceedings of ASPOCP (2018)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Orevkov, V.: Three ways of recognizing inessential formulas in sequents. J. Math. Sci. 20, 2351–2357 (1982)

    Article  Google Scholar 

  11. Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reason. 59(4), 483–502 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We would like to thank Pedro Cabalar for his suggestion to use anthem for verifying the strong equivalence of logic programs.

Author information

Authors and Affiliations

  1. University of Texas at Austin, Austin, USA

    Vladimir Lifschitz

  2. University of Potsdam, Potsdam, Germany

    Patrick Lühne & Torsten Schaub

  3. Simon Fraser University, Burnaby, Canada

    Torsten Schaub

  4. Griffith University, Gold Coast, Australia

    Torsten Schaub

Authors
  1. Vladimir Lifschitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Lühne
    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

Lifschitz, V., Lühne, P., Schaub, T. (2019). Verifying Strong Equivalence of Programs in the Input Language of gringo. 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_20

Download citation

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

  • 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