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 2017-09, Vol.17 (5-6), p.780-799
Hauptverfasser:	CUTERI, BERNARDO, DODARO, CARMINE, RICCA, FRANCESCO, SCHÜLLER, PETER
Format:	Artikel
Sprache:	eng
Schlagworte:	Empirical analysis Regular Papers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!