arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08292cs.AI
收藏

exp(ASPc):用选择原子和约束规则解释ASP程序

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

New Mexico State University(新墨西哥州立大学);Saint Joseph's University(圣约瑟夫大学)

Ly Ly Trieu, Tran Cao Son, Marcello Balduccini

摘要:

我们提出了一个扩展的exp(ASP)系统,它给出了一个正常逻辑程序P的回答集A,生成文字l(原子a或其缺省否定~a)的解释图,解释为什么l为真(或假)给定A和P。新系统,exp(ASPc),与exp(ASP)的不同之处在于,它支持选择规则,并利用约束规则来提供解释图,其中包括有关选择和约束的信息。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑