Using Lazy Unfolding for the Computation of Least Common Subsumers
A.-Y. Turhan, R. Molitor, in: C.A. Goble, D.L. McGuinness, R. Möller, P.F. Patel-Schneider (Eds.), Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, CEUR-WS.org, 2001.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Turhan, Anni-YasminLibreCat;
Molitor, Ralf
Editor
Goble, Carole A.;
McGuinness, Deborah L.;
Möller, Ralf;
Patel-Schneider, Peter F.
Publishing Year
Proceedings Title
Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001
forms.conference.field.series_title_volume.label
CEUR Workshop Proceedings
Volume
49
LibreCat-ID
Cite this
Turhan A-Y, Molitor R. Using Lazy Unfolding for the Computation of Least Common Subsumers. In: Goble CA, McGuinness DL, Möller R, Patel-Schneider PF, eds. Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001. Vol 49. CEUR Workshop Proceedings. CEUR-WS.org; 2001.
Turhan, A.-Y., & Molitor, R. (2001). Using Lazy Unfolding for the Computation of Least Common Subsumers. In C. A. Goble, D. L. McGuinness, R. Möller, & P. F. Patel-Schneider (Eds.), Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001 (Vol. 49). CEUR-WS.org.
@inproceedings{Turhan_Molitor_2001, series={CEUR Workshop Proceedings}, title={Using Lazy Unfolding for the Computation of Least Common Subsumers}, volume={49}, booktitle={Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin and Molitor, Ralf}, editor={Goble, Carole A. and McGuinness, Deborah L. and Möller, Ralf and Patel-Schneider, Peter F.}, year={2001}, collection={CEUR Workshop Proceedings} }
Turhan, Anni-Yasmin, and Ralf Molitor. “Using Lazy Unfolding for the Computation of Least Common Subsumers.” In Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, edited by Carole A. Goble, Deborah L. McGuinness, Ralf Möller, and Peter F. Patel-Schneider, Vol. 49. CEUR Workshop Proceedings. CEUR-WS.org, 2001.
A.-Y. Turhan and R. Molitor, “Using Lazy Unfolding for the Computation of Least Common Subsumers,” in Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, 2001, vol. 49.
Turhan, Anni-Yasmin, and Ralf Molitor. “Using Lazy Unfolding for the Computation of Least Common Subsumers.” Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, edited by Carole A. Goble et al., vol. 49, CEUR-WS.org, 2001.
Google Scholar