Games for query inseparability of description logic knowledge bases
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12038
- Type
- D - Journal article
- DOI
-
10.1016/j.artint.2016.01.010
- Title of journal
- Artificial Intelligence
- Article number
- -
- First page
- 78
- Volume
- 234
- Issue
- -
- ISSN
- 0004-3702
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this article was published at KR'14 under the title "Query Inseparability for Description Logic Knowledge Bases". It was invited to the Best Sister Conference Paper Track at IJCAI'15 and a popularised version was published as "When Are Description Logic Knowledge Bases Indistinguishable?". The paper is part of a wider research effort to understand inseparability for ontologies. For example, it is discussed in detail in the survey article "Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey" (Reasoning Web'16) and the Boolean case is analysed in "Query Inseparability for ALC Ontologies" (AIJ'19), both not REF returned.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -