A Revised Su cient Condition for Backtrack-Free Search


In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.