610
We show that the crucial operation of consistency checking for such descriptions is NP-complete , and therefore probably intractable , but proceed to develop algorithms which can sometimes alleviate the unpleasant consequences of this intractability .
 used for: consistency checking, descriptions
Given options, please tell me the relationships of all the listed entity pairs.Output format is "relation1: word1, word2; relation2: word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
 Entity Pairs:  consistency checking, descriptions 
Answer:
 used for: consistency checking, descriptions