Completeness for cut-based abduction

DOI10.1093/JIGPAL/JZT028MaRDI QIDQ5176673zbMATH OpenOpenAlexWikidataFDO

Authors Alexandre Matos Arruda, Marcelo Finger

Publication date 27 February 2015

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzt028

zbMATH Keywords

abductioncut-based abductionfirst-order abductionfirst-order tableauxKE-tableauxpropositional tableauxtableaux

Mathematics Subject Classification ID

Structure of proofs (03F07) Logic in artificial intelligence (68T27)

Recommendations

• Proving completeness of logic programs with the cut
• A Complete Classification of the Complexity of Propositional Abduction
• Regaining cut admissibility in deduction modulo using abstract completion
• Cut Elimination in Deduction Modulo by Abstract Completion
• Completeness for a first-order abstract separation logic
• Cut-Based Abduction
• Completeness results for circumscription
• Compilability of propositional abduction
• On the completeness of compositional reasoning methods

Cited in

(3)

• Towards automated first-order abduction: the cut-based approach
• Cut-Based Abduction
• Abduction as deductive saturation: a proof-theoretic inquiry

This page was built for publication: Completeness for cut-based abduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176673)