User guided abductive proof generation for answer set programming queries

• Main Authors: MAHAJAN, Avishkar, STRECKER, Martin, WONG, Meng Weng (HUANG Mingrong)
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2022
• Subjects: Theory of computation; Constraint and logic programming; Automated reasoning; Applied computing; Law; Programming Languages and Compilers; Science and Technology Law
• Online Access: https://ink.library.smu.edu.sg/sol_research/3995; https://ink.library.smu.edu.sg/context/sol_research/article/5953/viewcontent/PPDP_paper_official.pdf
• Institution: Singapore Management University

We present a method for generating possible proofs of a query with respect to a given Answer Set Programming (ASP) rule set using an abductive process where the space of abducibles is automatically constructed just from the input rules alone. Given a (possibly empty) set of user provided facts, our method infers any additional facts that may be needed for the entailment of a query and then outputs these extra facts, without the user needing to explicitly specify the space of all abducibles. We also present a method to generate a set of directed edges corresponding to the justification graph for the query. Furthermore, through different forms of implicit term substitution, our method can take user provided facts into account and suitably modify the abductive solutions. Past work on abduction has been primarily based on goal directed methods. However these methods can result in solvers that are not truly declarative. Much less work has been done on realizing abduction in a bottom up solver like the Clingo ASP solver. We describe novel ASP programs which can be run directly in Clingo to yield the abductive solutions and directed edge sets without needing to modify the underlying solving engine.