Reasoning on Schemas of Formulas: An Automata-Based Approach

DOI10.1007/978-3-319-15579-1_20zbMath1451.03018OpenAlexW4299145813MaRDI QIDQ2799178

Nicolas Peltier

Publication date: 8 April 2016

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-319-15579-1_20

zbMATH Keywords

automated reasoningsatisfiability modulo theoriesinductive reasoningschemata of formulas

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Mechanization of proofs and logical operations (03B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Decidability and Undecidability Results for Propositional Schemata
• Schemata of SMT-Problems
• Complexity of the Satisfiability Problem for a Class of Propositional Schemata
• Term Rewriting and All That
• RegSTAB: A SAT Solver for Propositional Schemata

This page was built for publication: Reasoning on Schemas of Formulas: An Automata-Based Approach