16 search results - page 4 / 4 » A New n-ary Existential Quantifier in Description Logics |
114
Voted
DLT
2010
14 years 11 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...