exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules

TL;DR

exp(ASPc) extends the exp(ASP) system to generate explanation graphs for answer sets of logic programs, incorporating choice and constraint rules to clarify why literals are true or false.

Contribution

It introduces exp(ASPc), a system that explains answer sets with enhanced support for choice and constraint rules, improving interpretability of logic programs.

Findings

Supports explanation of literals with choice and constraint rules

Generates detailed explanation graphs for answer sets

Enhances interpretability of logic programming

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.