Resolution in Solving Graph Problems

Kailiang Ji 1, *
* Corresponding author
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 :
Conference papers
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01245138
Contributor : Kailiang Ji <>
Submitted on : Tuesday, July 26, 2016 - 3:15:51 PM
Last modification on : Tuesday, January 9, 2018 - 2:13:30 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

141

Files downloads

226