Resolution in Solving Graph Problems

Kailiang Ji 1, *
* Auteur correspondant
Abstract : 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.
Type de document :
Communication dans un congrès
8th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2016), Jul 2016, Toronto, Canada
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01245138
Contributeur : Kailiang Ji <>
Soumis le : mardi 26 juillet 2016 - 15:15:51
Dernière modification le : mardi 9 janvier 2018 - 14:13:30

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01245138, version 2

Collections

Citation

Kailiang Ji. Resolution in Solving Graph Problems. 8th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2016), Jul 2016, Toronto, Canada. 〈hal-01245138v2〉

Partager

Métriques

Consultations de la notice

128

Téléchargements de fichiers

99