[DL] Decision problems of DL vs. FOL

Steve W s.wong.731 at gmail.com
Sun May 30 03:38:31 CEST 2010

Hi all,

According to the Wikipedia article on DL, it says that the decision problems
are more efficient than those of FOL. Are DL decision problems not
equivalent to those in FOL? For example, isn't subsumption checking
equivalent to checking implication? Is instance checking not equivalent to
evaluating the truth value of a predicate given a constant? Assuming what I
said is correct, then do all decision problems of DL have an equivalent form
in FOL? Which problems of FOL are not supported by DL?

Thanks for any input.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.informatik.uni-bremen.de/pipermail/dl/attachments/20100530/9d229685/attachment.html>

More information about the dl mailing list