Abstract
Recently, the Broken Triangle Property (BTP) and its extensions have been proposed to identify hybrid tractable classes of Constraint Satisfaction Problems (CSPs). In this paper, we extend the BTP to the concept of the Broken Triangle Property with adjoint values (BTPv), and then identify a more general hybrid tractable class of binary CSPs. To prove tractability, we present a polynomial-time algorithm to solve CSP instances in the new tractable class using a novel variable selection mechanism, and show correctness of it. We also show that determining whether an instance is in the class can be achieved efficiently. Furthermore, we provide comparisons with the BTP and its extensions showing that as a generalization of the BTP, the BTPv can find novel tractable CSPs, which cannot be identified by those existing tractable classes.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
