Resolution in Solving Graph Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Resolution in Solving Graph Problems


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
paper.pdf (525.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

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


  • HAL Id : hal-01245138 , version 2


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⟩
112 View
355 Download


Gmail Mastodon Facebook X LinkedIn More