Skip to content

Complexity of the Satisfiability Problem for a Class of Propositional Schemata.

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier

VenueCLATA
Year2010
ProceedingsLATA

Browse the full LATA paper archive.