The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

External Research Organisations

  • University of Manchester
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings of the 23rd International Workshop on Description Logics (DL 2010)
Publication statusPublished - 2010
Event24th International Workshop on Description Logics - Waterloo, Canada
Duration: 4 May 20107 May 2010

Cite this

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. / Meier, Arne; Schneider, Thomas.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 2010.

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Meier, A & Schneider, T 2010, The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. in Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 24th International Workshop on Description Logics, Waterloo, Ontario, Canada, 4 May 2010. <https://arxiv.org/abs/1001.4255>
Meier, A., & Schneider, T. (2010). The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. In Proceedings of the 23rd International Workshop on Description Logics (DL 2010) https://arxiv.org/abs/1001.4255
Meier A, Schneider T. The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. In Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 2010
Meier, Arne ; Schneider, Thomas. / The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 2010.
Download
@inproceedings{ff218bcc836f48aaa5640002669fcfa3,
title = "The Complexity of Satisfiability for Sub-Boolean Fragments of ALC",
author = "Arne Meier and Thomas Schneider",
note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 24th International Workshop on Description Logics ; Conference date: 04-05-2010 Through 07-05-2010",
year = "2010",
language = "English",
booktitle = "Proceedings of the 23rd International Workshop on Description Logics (DL 2010)",

}

Download

TY - GEN

T1 - The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

AU - Meier, Arne

AU - Schneider, Thomas

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2010

Y1 - 2010

M3 - Conference contribution

BT - Proceedings of the 23rd International Workshop on Description Logics (DL 2010)

T2 - 24th International Workshop on Description Logics

Y2 - 4 May 2010 through 7 May 2010

ER -

By the same author(s)