Complexity of the Satisfiability Problem for a Class of Propositional Schemata

DOI10.1007/978-3-642-13089-2_5zbMath1284.68287OpenAlexW2144978807MaRDI QIDQ3564849

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Classical propositional logic (03B05)

Related Items (2)

RegSTAB: A SAT Solver for Propositional Schemata ⋮ Reasoning on Schemas of Formulas: An Automata-Based Approach

This page was built for publication: Complexity of the Satisfiability Problem for a Class of Propositional Schemata