text: 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 .