A Resolution Calculus for Propositional Schemata

Vincent Aravantinos (1) , Mnacho Echenim (1) , Nicolas Peltier (1)

1 LIG - Laboratoire d'Informatique de Grenoble

This report describes a resolution calculus handling families of propositional formulae. The calculus is proven to be sound, refutationally complete and terminating. The main originality of our approach is the loop detection rule ensuring termination and refutational completeness.

Domaines: Logique en informatique [cs.LO]

Vincent Aravantinos, Mnacho Echenim, Nicolas Peltier. A Resolution Calculus for Propositional Schemata. 2011. ⟨hal-00932855⟩