- From: Jeff Z. Pan <pan@cs.man.ac.uk>
- Date: Tue, 8 Feb 2005 15:25:23 +0000
- To: Natasha Noy <noy@SMI.Stanford.EDU>
- Cc: swbp <public-swbp-wg@w3.org>
Hi Natasha, In case no one mentioned that before - there is a DL called DLR that supports n-ary relations. Knowledge satisfiability in DLR can be reduced into that of ALCIQ (a sub-language of SHIQ). Details about reasoning on UML class diagrams using DLR can be found in [1]. More details of DLR can be found in chapters of DL Handbook [2,3] and earlier papers (e.g. [4]). It could be a good idea to have DLR mentioned in the draft. Greetings, Jeff [1] http://www.dl.kr.org/adl2001/ki01dlws-papers/Berardi-et-al-01.ps.gz [2] @InCollection{CaDe03, author = "Diego Calvanese and De Giacomo, Giuseppe", title = "Expressive Description Logics", editor = "Franz Baader and Diego Calvanese and Deborah McGuinness and Daniele Nardi and Peter F. Patel-Schneider", booktitle = "The Description Logic Handbook: {T}heory, Implementation and Applications", publisher = CUP, year = 2003, chapter = 5, pages = "178--218", } [3] @InCollection{BoLR03, author = "Alexander Borgida and Maurizio Lenzerini and Riccardo Rosati", title = "Description Logics for Data Bases", editor = "Franz Baader and Diego Calvanese and Deborah McGuinness and Daniele Nardi and Peter F. Patel-Schneider", booktitle = "The Description Logic Handbook: {T}heory, Implementation and Applications", publisher = CUP, year = 2003, chapter = 16, pages = "462--484", } [4] @InProceedings{CaDL98, author = "Diego Calvanese and De Giacomo, Giuseppe and Maurizio Lenzerini", title = "On the Decidability of Query Containment under Constraints", booktitle = PODS-98, year = 1998, pages = "149--158", } -- Dr. Jeff Z. Pan ( http://DL-Web.man.ac.uk/ ) School of Computer Science, The University of Manchester
Received on Tuesday, 8 February 2005 15:26:21 UTC