Answer Set Programming modulo Acyclicity - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Answer Set Programming modulo Acyclicity

Résumé

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.
Fichier non déposé

Dates et versions

hal-01187003 , version 1 (25-08-2015)

Identifiants

Citer

Jori Bomanson, Martin Gebser, Toni Janhunen, Benjamin Kaufmann, Torsten Schaub. Answer Set Programming modulo Acyclicity. Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. pp.143-150, ⟨10.1007/978-3-319-23264-5_13⟩. ⟨hal-01187003⟩
168 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More