24 citations · 25 across the 3 of their papers we have counts for
3 papers
Decidability and Undecidability Results for Propositional Schemata
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized b…
Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata i…
A Decidable Class of Nested Iterated Schemata (extended version)
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its inpu…