Answer Set Programming modulo Acyclicity

Abstract : Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. The implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation.
Type de document :
Communication dans un congrès
F. Calimeri and G. Ianni and M. Truszczyski. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. Springer, 9345, pp.143-150, 2015, 〈10.1007/978-3-319-23264-5_13〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01187003
Contributeur : René Quiniou <>
Soumis le : mardi 25 août 2015 - 18:25:53
Dernière modification le : mercredi 16 mai 2018 - 11:23:02

Identifiants

Citation

Jori Bomanson, Martin Gebser, Toni Janhunen, Benjamin Kaufmann, Torsten Schaub. Answer Set Programming modulo Acyclicity. F. Calimeri and G. Ianni and M. Truszczyski. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. Springer, 9345, pp.143-150, 2015, 〈10.1007/978-3-319-23264-5_13〉. 〈hal-01187003〉

Partager

Métriques

Consultations de la notice

312