exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules
Artificial Intelligence
2021-09-20 v1
Abstract
We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal l - an atom a or its default negation ~a - given an answer set A of a normal logic program P, which explain why l is true (or false) given A and P. The new system, exp(ASPc), differs from exp(ASP) in that it supports choice rules and utilizes constraint rules to provide explanation graphs that include information about choices and constraints.
Keywords
Cite
@article{arxiv.2109.08292,
title = {exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules},
author = {Ly Ly Trieu and Tran Cao Son and Marcello Balduccini},
journal= {arXiv preprint arXiv:2109.08292},
year = {2021}
}
Comments
In Proceedings ICLP 2021, arXiv:2109.07914. In Proceedings the 37th International Conference on Logic Programming (ICLP 2021)