A Resolution Calculus for Propositional Schemata
Résumé
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]Origine | Fichiers produits par l'(les) auteur(s) |
---|