Resolution in Solving Graph Problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

Resolution in Solving Graph Problems

Résumé

Resolution is a proof-search method for proving unsatisfia-bility problems. Various refinements have been proposed to improve the efficiency of this method. However, when we try to prove some graph properties, it seems that none of the refinements have an efficiency comparable with traditional graph traversal algorithms. In this paper we propose a way of encoding some graph problems as resolution. We define a selection function and a new subsumption rule to avoid redundancies while solving such problems.
Fichier principal
Vignette du fichier
graph_resolution.pdf (483.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01245138 , version 1 (16-12-2015)
hal-01245138 , version 2 (26-07-2016)

Identifiants

  • HAL Id : hal-01245138 , version 1

Citer

Kailiang Ji. Resolution in Solving Graph Problems. 2015. ⟨hal-01245138v1⟩
112 Consultations
339 Téléchargements

Partager

Gmail Facebook X LinkedIn More