Skip to main content

DualGrounder: Lazy Instantiation via Clingo Multi-shot Framework

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2021)

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

Included in the following conference series:

  • 548 Accesses

Abstract

Answer set programming (ASP) is a declarative programming paradigm that is geared towards difficult combinatorial search problems. Sometimes, run times of ASP systems suffer due to so called grounding bottleneck. Lazy grounding solvers aim to mitigate this issue. In this paper we describe a new lazy grounding solver called DualGrounder. The DualGrounder system leverages multi-shot capabilities of the advanced ASP platform clingo. This paper also includes experimental data to explore the performance of DualGrounder compared to similar ASP grounding and solving systems.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Alviano, M., et al.: The fourth answer set programming competition: preliminary report. In: Cabalar, P., Son, T.C. (eds.) Logic Programming and Nonmonotonic Reasoning, pp. 42–53. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40564-8_5

    Chapter  Google Scholar 

  2. Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: a native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 54–66. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40564-8_6

    Chapter  Google Scholar 

  3. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  4. Calimeri, F., Ianni, G., Ricca, F.: The third open answer set programming competition. Theory Pract. Logic Program. 14(1), 117–135 (2014). https://doi.org/10.1017/S1471068412000105

    Article  Google Scholar 

  5. Cuteri, B., Dodaro, C., Ricca, F., Schüller, P.: Constraints, lazy constraints, or propagators in ASP solving: an empirical analysis. Theory Pract. Logic Program. 17(5–6), 780–799 (2017)

    Article  MathSciNet  Google Scholar 

  6. Cuteri, B., Dodaro, C., Ricca, F., Schüller, P.: Partial compilation of ASP programs. Theory Pract. Logic Program. 19(5–6), 857–873 (2019). https://doi.org/10.1017/S1471068419000231

    Article  MathSciNet  MATH  Google Scholar 

  7. Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: GASP: answer set programming with lazy grounding. Fundam. Inform. (2009). https://doi.org/10.3233/FI-2009-180

    Article  MathSciNet  MATH  Google Scholar 

  8. Dao-Tran, M., Eiter, T., Fink, M., Weidinger, G., Weinzierl, A.: OMiGA : an open minded grounding on-the-fly answer set solver. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 480–483. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33353-8_38

    Chapter  Google Scholar 

  9. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with cingo. Theory Pract. Logic Program. 19(1), 27–82 (2019). https://doi.org/10.1017/S1471068418000054

    Article  MathSciNet  MATH  Google Scholar 

  10. Gebser, M., Kaminski, R., König, A., Schaub, T.: Advances in gringo series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 345–351. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_39

    Chapter  Google Scholar 

  11. Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52–89 (2012)

    Article  MathSciNet  Google Scholar 

  12. Lefèvre, C., Nicolas, P.: The first version of a new ASP solver: ASPeRiX (2009). https://doi.org/10.1007/978-3-642-04238-6_52

  13. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25, 369–389 (1999)

    Article  MathSciNet  Google Scholar 

  14. Schüller, P.: Modeling variations of first-order horn abduction in answer set programming. Fundam. Inform. 149(1–2), 159–207 (2016). https://doi.org/10.3233/FI-2016-1446

    Article  MathSciNet  MATH  Google Scholar 

Download references

Conclusions and Acknowledgements

We trust that the DG system is a valuable representative among the class of lazy grounding systems. We also see its great value in showcasing how clingo multi-shot framework can be used in apparently “unintended” and meaningful ways. The work was partially supported by NSF grant 1707371.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Justin Robbins .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lierler, Y., Robbins, J. (2021). DualGrounder: Lazy Instantiation via Clingo Multi-shot Framework. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds) Logics in Artificial Intelligence. JELIA 2021. Lecture Notes in Computer Science(), vol 12678. Springer, Cham. https://doi.org/10.1007/978-3-030-75775-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-75775-5_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-75774-8

  • Online ISBN: 978-3-030-75775-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics