# A Decidable Class of Nested Iterated Schemata

@inproceedings{Aravantinos2010ADC,
title={A Decidable Class of Nested Iterated Schemata},
author={Vincent Aravantinos and Ricardo Caferra and Nicolas Peltier},
booktitle={IJCAR},
year={2010}
}
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.Pi, Pi+1, P1 or Pn, and with generalized connectives, e.g. $\bigwedge_{\rm i = 1}^n$, or $\bigvee_{\rm i = 1}^n$, where n is an (unbound) integer variable… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-8 OF 8 CITATIONS

## Generating Schemata of Resolution Proofs

• ArXiv
• 2011
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules

• J. Log. Comput.
• 2017
VIEW 2 EXCERPTS
CITES BACKGROUND

• TABLEAUX
• 2017

## Towards a Clausal Analysis of Proof Schemata

• 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
• 2017
VIEW 1 EXCERPT
CITES METHODS

## A Resolution Calculus for First-order Schemata

• Fundam. Inform.
• 2013
VIEW 2 EXCERPTS
CITES BACKGROUND

## Decidability and Undecidability Results for Propositional Schemata

• J. Artif. Intell. Res.
• 2011

## Linear Temporal Logic and Propositional Schemata, Back and Forth

• 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
• 2011

## On Deciding Satisfiability by Theorem Proving with Speculative Inferences

• Journal of Automated Reasoning
• 2010
VIEW 1 EXCERPT
CITES METHODS