Cut-Based Abduction

DOI10.1093/JIGPAL/JZN020MaRDI QIDQ5504120zbMATH OpenOpenAlexWikidataFDO

Authors Marcello D'Agostino, Marcelo Finger, Dov Gabbay

Publication date 21 January 2009

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

Full work available at URL https://semanticscholar.org/paper/9eb7eea93a0d1f017b6eb3b56ea2b02cb2c0acb6

zbMATH Keywords

abductioncut formulahypothesis generationlemma generationsequent calculustableau-like system

Mathematics Subject Classification ID

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

Recommendations

• Completeness for cut-based abduction
• Towards automated first-order abduction: the cut-based approach
• Abduction and diagrams
• On classifying abduction
• scientific article; zbMATH DE number 1696742
• The computational complexity of abduction
• Cuts and bounds

Cited in

(12)

• Intuitive minimal abduction in sequent calculi
• The problem of \(\Pi_{2}\)-cut-introduction
• Abduction: a categorical characterization
• Towards automated first-order abduction: the cut-based approach
• Abduction through semantic tableaux versus abduction through goal-directed proofs
• scientific article; zbMATH DE number 67456 (Why is no real title available?)
• Abduction and diagrams
• Completeness for cut-based abduction
• Using Abduction to Compute Efficient Proofs
• Abduction as deductive saturation: a proof-theoretic inquiry
• Linear logic in a refutational setting
• Natural constructive proofs of A via A B, proof paradoxes, and impredicativity

This page was built for publication: Cut-Based Abduction

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