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

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.

Risorse UNIGE


Titolo: Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis
Autori: 
DODARO, CARMINE
mostra contributor esterni 
Data di pubblicazione: 2017
Rivista: 
THEORY AND PRACTICE OF LOGIC PROGRAMMING  
Handle: http://hdl.handle.net/11567/880234
Appare nelle tipologie:01.01 - Articolo su rivista

File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021