Complexity of the satisfiability problem for a class of propositional schemata

DOI10.1007/978-3-642-13089-2_5MaRDI QIDQ3564849zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Tractable and intractable classes of propositional schemata
• Decidability and undecidability results for propositional schemata
• A decidable class of nested iterated schemata
• RegSTAB: A SAT Solver for Propositional Schemata
• A resolution calculus for first-order schemata

Cited in

(10)

• Reasoning on schemas of formulas: an automata-based approach
• Reasoning on schemata of formulæ
• Decidability and undecidability results for propositional schemata
• Schemata of SMT-problems
• Satisfiability for SCULPT-schemas for CSV-like data
• A Complexity Index for Satisfiability Problems
• A tableaux-based decision procedure for multi-parameter propositional schemata
• Tractable and intractable classes of propositional schemata
• A decidable class of nested iterated schemata
• RegSTAB: A SAT Solver for Propositional Schemata

This page was built for publication: Complexity of the satisfiability problem for a class of propositional schemata

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