Reasoning on schemas of formulas: an automata-based approach

DOI10.1007/978-3-319-15579-1_20zbMATH Open1451.03018OpenAlexW4299145813MaRDI QIDQ2799178FDOQ2799178

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

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

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)

Cites Work

• RegSTAB: A SAT Solver for Propositional Schemata
• Term Rewriting and All That
• Title not available (Why is that?)
• Handbook of automated reasoning. In 2 vols
• Decidability and undecidability results for propositional schemata
• Schemata of SMT-problems
• Complexity of the satisfiability problem for a class of propositional schemata

Cited In (2)

• Title not available (Why is that?)
• An Incremental Technique for Automata-Based Decision Procedures

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)