A Decidable Class of Nested Iterated Schemata (extended version)

by   Vincent Aravantinos, et al.

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 input. We define a logic whose formulae, called "iterated schemata", allow to express such patterns. Schemata extend propositional logic with indexed propositions, e.g. P_i, P_i+1, P_1, and with generalized connectives, e.g. /ı=1..n or i=1..n (called "iterations") where n is an (unbound) integer variable called a "parameter". The expressive power of iterated schemata is strictly greater than propositional logic: it is even out of the scope of first-order logic. We define a proof procedure, called DPLL*, that can prove that a schema is satisfiable for at least one value of its parameter, in the spirit of the DPLL procedure. However the converse problem, i.e. proving that a schema is unsatisfiable for every value of the parameter, is undecidable so DPLL* does not terminate in general. Still, we prove that it terminates for schemata of a syntactic subclass called "regularly nested". This is the first non trivial class for which DPLL* is proved to terminate. Furthermore the class of regularly nested schemata is the first decidable class to allow nesting of iterations, i.e. to allow schemata of the form /ı=1..n (/ȷ=1..n ...).


page 1

page 2

page 3

page 4


Decidability and Undecidability Results for Propositional Schemata

We define a logic of propositional formula schemata adding to the syntax...

A note on undecidability of propositional non-associative linear logics

We introduce a non-associative and non-commutative version of propositio...

Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)

This paper relates the well-known Linear Temporal Logic with the logic o...

A First Polynomial Non-Clausal Class in Many-Valued Logic

The relevance of polynomial formula classes to deductive efficiency moti...

Verifying Graph Programs with First-Order Logic (Extended Version)

We consider Hoare-style verification for the graph programming language ...

Non-commutative propositional logic with short-circuited biconditional and NAND

Short-circuit evaluation denotes the semantics of propositional connecti...

Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant

Short-circuit evaluation denotes the semantics of propositional connecti...

Please sign up or login with your details

Forgot password? Click here to reset