Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Handbook of automated reasoning
Handbook of automated reasoning
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Schemata Calculus for Propositional Logic
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the Proof Theory of Regular Fixed Points
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the structure of inductive reasoning: circular and tree-shaped proofs in the µ-calculus
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Cyclic proofs for first-order logic with inductive definitions
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
RegSTAB: a SAT solver for propositional schemata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generalized) connectives like e.g. $\bigwedge^{n}_{i=1}$ and $\bigvee^{n}_{i=1}$ where n is a parameter. With these connectives the new logic includes formulae such as $\bigwedge^{n}_{i=1} {(P_i \Rightarrow P_{i+1})}$ (atoms are of the form P1, Pi+5, Pn, ...). The satisfiability problem for such a schema S is: “Are all the formulae denoted by S valid (or satisfiable)?” which is undecidable [2]. In this paper we focus on a specific class of schemata for which this problem is decidable: regular schemata. We define an automata-based procedure, called schaut, solving the satisfiability problem for such schemata. schaut has many advantages over procedures in [2,1]: it is more intuitive, more concise, it allows to make use of classical results on finite automata and it is tuned for an efficient treatment of regular schemata. We show that the satisfiability problem for regular schemata is in 2-EXPTIME and that this bound is tight for our decision procedure.