Synthetic tableaux: Minimal tableau search heuristics

DOI10.1007/978-3-031-10769-6_25OpenAlexW4289104032MaRDI QIDQ2104533

Dorota Leszczyńska-Jasion, Marcin Jukiewicz, Szymon Chlebowski, Michał Sochański, Agata Tomczyk

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_25

zbMATH Keywords

data analysisHaskellpigeonhole principleminimal tableauproof-search heuristicssynthetic tableau

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Representing formulas of propositional logic by cographs, permutations and tables

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The intractability of resolution
• Completely non-clausal theorem proving
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation
• Polynomial size proofs of the propositional pigeonhole principle
• The relative efficiency of propositional proof systems
• The Taming of the Cut. Classical Refutations with Analytic Cut

This page was built for publication: Synthetic tableaux: Minimal tableau search heuristics