RegSTAB: A SAT Solver for Propositional Schemata

DOI10.1007/978-3-642-14203-1_26zbMath1291.68317OpenAlexW1561293563MaRDI QIDQ5747769

Vincent Aravantinos, Nicolas Peltier, Ricardo Caferra

Publication date: 14 September 2010

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14203-1_26

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Related Items (2)

Reasoning on Schemas of Formulas: An Automata-Based Approach ⋮ RegStab

Cites Work

• Complexity of the Satisfiability Problem for a Class of Propositional Schemata
• A Schemata Calculus for Propositional Logic
• A Tableaux Method for Systematic Simultaneous Search for Refutations and Models using Equational Problems
• Automated Reasoning with Analytic Tableaux and Related Methods
• A Decidable Class of Nested Iterated Schemata

This page was built for publication: RegSTAB: A SAT Solver for Propositional Schemata