{"_id":"56573","editor":[{"first_name":"Carole A.","last_name":"Goble","full_name":"Goble, Carole A."},{"first_name":"Deborah L.","last_name":"McGuinness","full_name":"McGuinness, Deborah L."},{"last_name":"Möller","first_name":"Ralf","full_name":"Möller, Ralf"},{"full_name":"Patel-Schneider, Peter F.","first_name":"Peter F.","last_name":"Patel-Schneider"}],"type":"conference","year":"2001","status":"public","date_updated":"2024-10-10T13:44:10Z","language":[{"iso":"eng"}],"series_title":"CEUR Workshop Proceedings","intvolume":"        49","author":[{"last_name":"Turhan","first_name":"Anni-Yasmin","id":"104470","full_name":"Turhan, Anni-Yasmin"},{"first_name":"Ralf","last_name":"Molitor","full_name":"Molitor, Ralf"}],"title":"Using Lazy Unfolding for the Computation of Least Common Subsumers","citation":{"chicago":"Turhan, Anni-Yasmin, and Ralf Molitor. “Using Lazy Unfolding for the Computation of Least Common Subsumers.” In <i>Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001</i>, 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.","bibtex":"@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} }","mla":"Turhan, Anni-Yasmin, and Ralf Molitor. “Using Lazy Unfolding for the Computation of Least Common Subsumers.” <i>Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001</i>, edited by Carole A. Goble et al., vol. 49, CEUR-WS.org, 2001.","short":"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.","ieee":"A.-Y. Turhan and R. Molitor, “Using Lazy Unfolding for the Computation of Least Common Subsumers,” in <i>Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001</i>, 2001, vol. 49.","apa":"Turhan, A.-Y., &#38; Molitor, R. (2001). Using Lazy Unfolding for the Computation of Least Common Subsumers. In C. A. Goble, D. L. McGuinness, R. Möller, &#38; P. F. Patel-Schneider (Eds.), <i>Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001</i> (Vol. 49). CEUR-WS.org.","ama":"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. <i>Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001</i>. Vol 49. CEUR Workshop Proceedings. CEUR-WS.org; 2001."},"user_id":"15504","publication":"Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001","publisher":"CEUR-WS.org","volume":49,"date_created":"2024-10-10T13:43:55Z"}