Simplification rules for constrained formula tableaux

DOI10.1007/B12030MaRDI QIDQ5187860zbMATH OpenOpenAlexFDO

Authors Martin Giese

Publication date 9 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12030

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)

Recommendations

• scientific article; zbMATH DE number 1189106
• scientific article; zbMATH DE number 517067
• Simplifying and generalizing formulae in tableaux. Pruning the search space and building models
• Hyper tableaux
• scientific article; zbMATH DE number 1841823

Cited in

(8)

• On simplification of formulas with unconstrained variables and quantifiers
• Fast simplifications for Tarski formulas
• Theorem proving with bounded rigid E-unification
• Improvement of a tableau-based algorithm and the finite-step halting theorem
• scientific article; zbMATH DE number 517067 (Why is no real title available?)
• RegSTAB: A SAT Solver for Propositional Schemata
• A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux
• The disconnection tableau calculus

This page was built for publication: Simplification rules for constrained formula tableaux

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