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.

翻译：我们展示了Exp(ASP)的增强,这个系统为一字一字(原子或默认否定~a)生成解释性图表,给一个正常逻辑程序P的回答A集,解释为什么l是真实的(或虚假的)给A和P。 新的系统(Exp(ASPc))不同于Exp(ASP),因为它支持选择规则并利用约束性规则提供解释性图表,包括关于选择和限制的信息。