Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis [chapter]

Andrew Reynolds, Haniel Barbosa, Daniel Larraz, Cesare Tinelli
2020 Lecture Notes in Computer Science  
The abduction problem in logic asks whether there exists a formula that is consistent with a given set of axioms and, together with these axioms, suffices to entail a given goal. We propose an approach for solving this problem that is based on syntax-guided enumeration. For scalability, we use a novel procedure that incrementally constructs a solution in disjunctive normal form that is built from enumerated formulas. The procedure can be configured to generate progressively weaker and simpler
more » ... lutions over the course of a run of the procedure. Our approach is fully general and can be applied over any background logic that is handled by the underlying SMT solver in our approach. Our experiments show our approach compares favorably with other tools for abductive reasoning.
doi:10.1007/978-3-030-51074-9_9 fatcat:d6ndidsc4ffjbams3nj2gfujfq