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

Creative Commons License

Cuteri B., Dodaro C., Ricca F., Schueller P.

THEORY AND PRACTICE OF LOGIC PROGRAMMING, cilt.17, ss.780-799, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 17
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1017/s1471068417000254
  • Dergi Adı: THEORY AND PRACTICE OF LOGIC PROGRAMMING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.780-799
  • Anahtar Kelimeler: Answer set programming, lazy grounding, propagators, ANSWER, INTEGRATION, SYSTEM
  • Marmara Üniversitesi Adresli: Evet

Özet

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.