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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 17; H. 5-6; S. 780 - 799
Hauptverfasser:	CUTERI, BERNARDO, DODARO, CARMINE, RICCA, FRANCESCO, SCHÜLLER, PETER
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.09.2017
Schlagworte:	Empirical analysis Regular Papers Answer set programming lazy grounding propagators
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!