Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Resolution in Solving Graph Problems

Kailiang Ji 1, *
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Kailiang Ji <>
Submitted on : Wednesday, December 16, 2015 - 5:39:13 PM
Last modification on : Friday, May 25, 2018 - 12:02:06 PM
Long-term archiving on: : Saturday, April 29, 2017 - 5:12:46 PM


Files produced by the author(s)


  • HAL Id : hal-01245138, version 1


Kailiang Ji. Resolution in Solving Graph Problems. 2015. ⟨hal-01245138v1⟩



Record views


Files downloads