Using Abduction to Compute Efficient Proofs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4166861
- An abductive proof procedure for conditional logic programming
- Abduction and dialogical proof in argumentation and logic programming
- scientific article; zbMATH DE number 3900184
- A Hybrid Abductive Inductive Proof Procedure
- Abstractions from proofs
- Proving as fast as computing: succinct arguments with constant prover overhead
- The computational complexity of abduction
- AI*IA 2005: Advances in Artificial Intelligence
Cites work
- scientific article; zbMATH DE number 4174356 (Why is no real title available?)
- scientific article; zbMATH DE number 3132713 (Why is no real title available?)
- scientific article; zbMATH DE number 67456 (Why is no real title available?)
- scientific article; zbMATH DE number 877749 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Advice on Abductive Logic
- Cut-Based Abduction
- The Taming of the Cut. Classical Refutations with Analytic Cut
Cited in
(3)
This page was built for publication: Using Abduction to Compute Efficient Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178959)