Synthetic tableaux: Minimal tableau search heuristics
From MaRDI portal
Publication:2104533
Cites work
- scientific article; zbMATH DE number 1220670 (Why is no real title available?)
- scientific article; zbMATH DE number 2024622 (Why is no real title available?)
- scientific article; zbMATH DE number 2033314 (Why is no real title available?)
- scientific article; zbMATH DE number 2109247 (Why is no real title available?)
- scientific article; zbMATH DE number 834573 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 2213624 (Why is no real title available?)
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Completely non-clausal theorem proving
- Identifying efficient abductive hypotheses using multicriteria dominance relation
- Polynomial size proofs of the propositional pigeonhole principle
- Tableau methods for classical propositional logic
- The Taming of the Cut. Classical Refutations with Analytic Cut
- The intractability of resolution
- The relative efficiency of propositional proof systems
This page was built for publication: Synthetic tableaux: Minimal tableau search heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104533)