Inference in Description Logic

• The notion of inference for a, say, ALH vocabulary V and W is the same as in the general case

• Of course, the algorithms to decide whether V ⊧ALH W are much more complicated than for Ex

• The most widespread algorithm for Description Logics is the “tableau” algorithm