How can we prove that a proof search method is not an instance of another? - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

How can we prove that a proof search method is not an instance of another?

Résumé

We introduce a method to prove that a proof search method is not an instance of another. As an example of application, we show that Polarized resolution modulo, a method that mixes clause selection restrictions and literal selection restrictions, is not an instance of Ordered resolution with selection.
Fichier principal
Vignette du fichier
montreal.pdf (237.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04078083 , version 1 (22-04-2023)

Identifiants

Citer

Guillaume Burel, Gilles Dowek. How can we prove that a proof search method is not an instance of another?. 2009. ⟨hal-04078083⟩
2 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More