![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Vitaliy L. Khizder 3 Vitaliy L. Khizder, David Toman , Grant E. Weddell : On Decidability and Complexity of Description Logics with Uniqueness Constraints. ICDT 2001 : 54-67 2 Vitaliy L. Khizder, David Toman , Grant E. Weddell : Reasoning about Duplicate Elimination with Description Logic. Computational Logic 2000 : 1017-1032 1 Vitaliy L. Khizder, David Toman , Grant E. Weddell : On Decidability and Complexity of Description Logics with Uniqueness Constraints. Description Logics 2000 : 193-202 ![]() DiSC'02 © 2003 Association for Computing Machinery |