Publisher: Cambridge University Press
E-ISSN: 1475-3081|17|5-6|780-799
ISSN: 1471-0684
Source: Theory and Practice of Logic Programming, Vol.17, Iss.5-6, 2017-09, pp. : 780-799
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Solving regional constraints in components layout design based on geometric gadgets
AI EDAM, Vol. 11, Iss. 4, 1997-09 ,pp. :
Discovering implicit constraints in design
AI EDAM, Vol. 25, Iss. 1, 2011-02 ,pp. :
Exploratory design using constraints
AI EDAM, Vol. 1, Iss. 1, 1987-02 ,pp. :
Contractibility for open global constraints
Theory and Practice of Logic Programming, Vol. 17, Iss. 4, 2017-07 ,pp. :