Automatic Partitioning of OWL ontologies using e-connections

CEUR Workshop Proceedings

Volumn 147, Issue , 2005, Pages

  Grau, Bernardo Cuenca ^a   Parsia, Bijan ^a   Sirin, Evren ^a   Kalyanpur, Aditya ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849095324     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. B. Cuenca-Grau, B. Parsia, and E.Sirin. Tableau algorithms for EConnections of description logics. Technical report, UMIACS, 2004. http://www.mindswap.org/2004/multipleOnt/papers/EconnTableau.ps.
2. B. Cuenca-Grau, B. Parsia, E.Sirin, and A.Kalyanpur. Automatic partitioning of OWL ontologies using E-Connections. Technical report, UMIACS, 2005. Available at http://www.mindswap.org/2004/multipleOnt/papers/Partition. pdf.
3. B. Cuenca Grau, B. Parsia, and E.Sirin. Combining owl ontologies using E-connections. Elsevier's Journal on Web Semantics, 2005. To Appear. http://www.mindswap.org/2004/multipleOnt/papers/EconnJWS.pdf.
4. O. Kutz, C. Lutz, F. Wolter, and M. Zakharyaschev. E-Connections of abstract description systems. Artificial Intelligence 156(1):1-73, 2004.
5. B. MacCartney, S. A. McIlraith, E. Amir, and T. Uribe. Practical partition-based theorem proving for large knowledge bases. In Proc. of IJCAI 2003, 2003.
6. H. StuckenSchmidt and M. Klein. Structure-based partitioning of large class hierarchies. In Proc. of ISWC 2004, 2004.