This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Maximum Renamable Horn and Maximum Independent Sets
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses. The renamable Horn problem is solvable in linear time, but the maximum renamable Horn problem (MAX-RHS) is NP-hard. In this paper, we present transformations between clause sets and undirected graphs in polynomial time, such that finding a renamable Horn subset of a clause set is equivalent to finding an independent set of vertices of a graph. Then, the problems MAX-RHS and MAX-IND have the same complexity, and MAX-RHS is inapproximable.
Index Terms:
maximum renamable Horn set, maximum independent set, polynomial transformation, NP-Hardness, inapproximability
Citation:
Yongbin Qin, Daoyun Xu, "Maximum Renamable Horn and Maximum Independent Sets," csie, vol. 1, pp.743-747, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.