4280
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 .
 consistency checking, descriptions
Please list all entity pairs containing a certain relationship in the given options.Output format is "word1, word2; word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 consistency checking, descriptions