Reasoning on schemas of formulas: an automata-based approach

DOI10.1007/978-3-319-15579-1_20MaRDI QIDQ2799178zbMATH OpenOpenAlexFDO

Authors 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

satisfiability modulo theoriesautomated reasoninginductive reasoningschemata of formulas

Mathematics Subject Classification ID

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

Recommendations

• Reasoning on schemata of formulæ
• Schemata of SMT-problems
• Complexity of the satisfiability problem for a class of propositional schemata
• A Schemata Calculus for Propositional Logic
• scientific article; zbMATH DE number 6938205

Cites work

• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• Complexity of the satisfiability problem for a class of propositional schemata
• Decidability and undecidability results for propositional schemata
• Handbook of automated reasoning. In 2 vols
• RegSTAB: A SAT Solver for Propositional Schemata
• Schemata of SMT-problems
• Term Rewriting and All That

Cited in

(4)

• An Incremental Technique for Automata-Based Decision Procedures
• scientific article; zbMATH DE number 1396671 (Why is no real title available?)
• Reasoning on schemata of formulæ
• A tableaux-based decision procedure for multi-parameter propositional schemata

This page was built for publication: Reasoning on schemas of formulas: an automata-based approach

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