On the Complexity of Extending Ground Resolution with Symmetry Rules - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1995

On the Complexity of Extending Ground Resolution with Symmetry Rules

Résumé

One important issue of automated theorem proving is the complexity of the inference rules used in theorem provers. If Krishnamurty's general symmetry rule is to be used, then one should provide some way of computing non trivial symmetries. We show that this prob- lem is NP-complete. But this general rule can be simplified by restricting it to what we call S-symmetries, yielding the well-known symmetry rule. We show that computing S-symmetries is in the same complexity class as the graph isomorphism problem, which appears to be neither polynomial nor NP-complete. However it is sufficient to compute the set of all S-symmetries at the beginning of the proof search, and since it is a permutation group, there exist some efficient techniques from computational group theory to represent this set. We also show how these techniques can be used for applying the S-symmetry rule in polynomial time. $\mathbf{(paper \ available \ at \ \mbox{http://ijcai.org/Proceedings/95-1/Papers/038.pdf})}$
Fichier principal
Vignette du fichier
BoyDem-ijcai95.pdf (9.32 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03195326 , version 1 (11-04-2021)

Identifiants

  • HAL Id : hal-03195326 , version 1

Citer

Thierry Boy de La Tour, Stéphane Demri. On the Complexity of Extending Ground Resolution with Symmetry Rules. Fourteenth International Joint Conference on Artificial Intelligence, (IJCAI'95), Aug 1995, Montreal, Canada. pp.289-295. ⟨hal-03195326⟩

Collections

UGA CNRS
42 Consultations
33 Téléchargements

Partager

Gmail Facebook X LinkedIn More