Abstract
In this paper, we introduce the notion of ω-graph as a representative graph for the hypergraph associated with general constraint satisfaction problems (CSPs) and define a new form of consistency called ω-consistency. We identify relationships between the structural property of the ω-graph and the level of ω-consistency that are sufficient to ensure tractability of general CSPs and we prove that the class of tractable CSPs identified here contains the class of tractable CSPs identified with some related conditions reported previously.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
