Skip to main content
SpringerLink
Log in

Blending Lazy-Grounding and CDNL Search for Answer-Set Solving

  • Conference paper
  • First Online:
Book cover Logic Programming and Nonmonotonic Reasoning (LPNMR 2017)

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

Abstract

Efficient state-of-the-art answer-set solvers are two-phased: first grounding the input program, then applying search based on conflict-driven nogood learning (CDNL). The latter provides superior search performance but the former causes exponential memory requirements for many ASP programs. Lazy-grounding avoids this grounding bottleneck but exhibits poor search performance. The approach here aims for the best of both worlds: grounding and solving are interleaved, but there is a solving component distinct from the grounding component. The solving component works on (ground) nogoods, employs conflict-driven first-UIP learning and enables heuristics. Guessing is on atoms that represent applicable rules, atoms may be one of true, false, or must-be-true, and nogoods have a distinguished head literal. The lazy-grounding component is loosely coupled to the solver and may yield more ground instances than necessary, which avoids re-grounding whenever the solver moves from one search branch to another. The approach is implemented in the new ASP solver Alpha.

This research has been funded by the Austrian Science Fund (FWF): P27730.

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

References

  1. 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). doi:10.1007/978-3-642-40564-8_6

    Chapter  Google Scholar 

  2. Balduccini, M., Lierler, Y., Schüller, P.: Prolog and ASP inference under one roof. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 148–160. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40564-8_15

    Chapter  Google Scholar 

  3. Calimeri, F., Fuscà, D., Perri, S., Zangari, J.: I-DLV: the new intelligent grounder of DLV. In: AI*IA, pp. 192–207 (2016)

    Google Scholar 

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

    Chapter  Google Scholar 

  5. Dovier, A., Formisano, A., Pontelli, E., Vella, F.: A GPU implementation of the ASP computation. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 30–47. Springer, Cham (2016). doi:10.1007/978-3-319-28228-2_3

    Chapter  Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 190–205. Springer, Heidelberg (2008). doi:10.1007/978-3-540-89982-2_23

    Chapter  Google Scholar 

  7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 260–265. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72200-7_23

    Chapter  Google Scholar 

  8. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 136–148. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72200-7_13

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235–249. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02846-5_22

    Chapter  Google Scholar 

  11. Lefèvre, C., Beatrix, C., Stephan, I., Garcia, L.: Asperix, a first-order forward chaining approach for answer set computing. TPLP 17(3), 266–310 (2017)

    MathSciNet  Google Scholar 

  12. Lefèvre, C., Nicolas, P.: A first order forward chaining approach for answer set computing. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 196–208. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04238-6_18

    Chapter  Google Scholar 

  13. Lefèvre, C., Nicolas, P.: The first version of a new ASP solver : ASPeRiX. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 522–527. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04238-6_52

    Chapter  Google Scholar 

  14. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7, 499–562 (2002)

    Article  MathSciNet  Google Scholar 

  15. Palù, A.D., Dovier, A., Pontelli, E., Rossi, G.: Gasp: answer set programming with lazy grounding. Fundam. Inform. 96(3), 297–322 (2009)

    MathSciNet  MATH  Google Scholar 

  16. Teppan, E.C., Friedrich, G.: Heuristic constraint answer set programming. In: ECAI. FAIA, vol. 285, pp. 1692–1693. IOS Press (2016)

    Google Scholar 

  17. Weinzierl, A.: Learning non-ground rules for answer-set solving. In: Grounding and Transformation for Theories with Variables, pp. 25–37 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems, Knowledge-based Systems Group, TU Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Antonius Weinzierl

Authors
  1. Antonius Weinzierl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonius Weinzierl .

Editor information

Editors and Affiliations

  1. Drexel University, Philadelphia, Pennsylvania, USA

    Marcello Balduccini

  2. Aalto University, Espoo, Finland

    Tomi Janhunen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Weinzierl, A. (2017). Blending Lazy-Grounding and CDNL Search for Answer-Set Solving. In: Balduccini, M., Janhunen, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2017. Lecture Notes in Computer Science(), vol 10377. Springer, Cham. https://doi.org/10.1007/978-3-319-61660-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61660-5_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61659-9

  • Online ISBN: 978-3-319-61660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation