Synthetic tableaux: Minimal tableau search heuristics

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

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)

Cites Work

• Title not available (Why is that?)
• The Taming of the Cut. Classical Refutations with Analytic Cut
• The relative efficiency of propositional proof systems
• Title not available (Why is that?)
• The intractability of resolution
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Tableau methods for classical propositional logic
• Title not available (Why is that?)
• Polynomial size proofs of the propositional pigeonhole principle
• Title not available (Why is that?)
• Completely non-clausal theorem proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Representing formulas of propositional logic by cographs, permutations and tables

Uses Software

• Haskell

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)