Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis*. Issue 5 (24th August 2017)

• Record Type: Journal Article
• Authors: CUTERI, BERNARDO; DODARO, CARMINE; RICCA, FRANCESCO; SCHÜLLER, PETER
• Editors: Rocha, Ricardo; Cao Son, Tran
• Is Part Of: Theory and practice of logic programming. Volume 17:Issue 5/6(2017)
• Page Start: 780
• Page End: 799
• Publication Date: 2017-08-24
• Subjects: Answer set programming, -- lazy grounding, -- propagators; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068417000254
• Languages: English
• ISSNs: 1471-0684

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.