User guided abductive proof generation for answer set programming queries
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...
Saved in:
Main Authors: | MAHAJAN, Avishkar, STRECKER, Martin, WONG, Meng Weng (HUANG Mingrong) |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Automating defeasible reasoning in law with answer set programming
by: LIM, How Khang, et al.
Published: (2022) -
Incorrectness logic for graph programs
by: POSKITT, Christopher M.
Published: (2021) -
Compliance through model checking
by: MAHAJAN, Avishkar, et al.
Published: (2022) -
Constraint answer set programming as a tool to improve legislative drafting
by: MORRIS, Jason
Published: (2021) -
A labelled sequent calculus for BBI : proof theory and proof search
by: Hóu, Zhé, et al.
Published: (2020)