Skip to main content
×
Home
    • Aa
    • Aa

Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis*

  • BERNARDO CUTERI (a1), CARMINE DODARO (a2), FRANCESCO RICCA (a3) and PETER SCHÜLLER (a4) (a5)
Abstract
Abstract

Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.

Copyright
Footnotes
Hide All
*

The paper has been partially supported by the Italian Ministry for Economic Development (MISE) under project “PIUCultura – Paradigmi Innovativi per l'Utilizzo della Cultura” (no. F/020016/01-02/X27), under project “Smarter Solutions in the Big Data World (S2BDW)” (no. F/050389/01-03/X32) funded within the call “HORIZON2020” PON I&C 2014-2020, and by the Scientific and Technological Research Council of Turkey (TUBITAK) Grant 114E777.

Footnotes
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 4 *
Loading metrics...

Abstract views

Total abstract views: 27 *
Loading metrics...

* Views captured on Cambridge Core between 24th August 2017 - 26th September 2017. This data will be updated every 24 hours.