This paper introduces a new level of partial consistency for constraint satisfaction problems, which is situated between arc and path-consistency. We call this level restricted path-consistency (RPC). Two procedures to enforce complete and partial RPC are presented. They both use path-based verifications to detect inconsistencies but retain the good features of arcconsistency since they only touch the variables domains and do not augment the connectivity of the constraint graph. We show that, although they perform a limited number of checks, these procedures exhibit a considerable pruning power.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.