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 cons...

Full description

Bibliographic Details

Published in:	Theory and practice of logic programming Vol. 17; no. 5-6; pp. 780 - 799
Main Authors:	CUTERI, BERNARDO, DODARO, CARMINE, RICCA, FRANCESCO, SCHÜLLER, PETER
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2017
Subjects:	Empirical analysis Regular Papers Answer set programming lazy grounding propagators
ISSN:	1471-0684, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!