Ontology type: schema:ScholarlyArticle Open Access: True
2021-08-31
AUTHORS ABSTRACTThis paper partially bridges a gap in the literature on Circumscription in Description Logics by investigating the tractability of conjunctive query answering in OWL2’s profiles. It turns out that the data complexity of conjunctive query answering is coNP-hard in circumscribed EL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {E}{\mathscr{L}}$\end{document} and DL-lite, while in circumscribed OWL2-RL conjunctive queries retain their classical semantics. In an attempt to capture nonclassical inferences in OWL2-RL, we consider conjunctive queries with safe negation. They can detect some of the nonclassical consequences of circumscribed knowledge bases, but data complexity becomes coNP-hard. In circumscribed EL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {E}{\mathscr{L}}$\end{document}, answering queries with safe negation is undecidable. More... »
PAGES1155-1173
http://scigraph.springernature.com/pub.10.1007/s10472-021-09770-2
DOIhttp://dx.doi.org/10.1007/s10472-021-09770-2
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1140776801
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Data Format",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Universit\u00e0 di Napoli Federico II, Napoli, Italy",
"id": "http://www.grid.ac/institutes/grid.4691.a",
"name": [
"Universit\u00e0 di Napoli Federico II, Napoli, Italy"
],
"type": "Organization"
},
"familyName": "Bonatti",
"givenName": "Piero A.",
"id": "sg:person.011766255474.79",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011766255474.79"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/978-3-642-23580-1_22",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1004950933",
"https://doi.org/10.1007/978-3-642-23580-1_22"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-319-14726-0_8",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1014829987",
"https://doi.org/10.1007/978-3-319-14726-0_8"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf00883932",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1011973855",
"https://doi.org/10.1007/bf00883932"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-319-45276-0_5",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1007049978",
"https://doi.org/10.1007/978-3-319-45276-0_5"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf00881830",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1003771115",
"https://doi.org/10.1007/bf00881830"
],
"type": "CreativeWork"
}
],
"datePublished": "2021-08-31",
"datePublishedReg": "2021-08-31",
"description": "This paper partially bridges a gap in the literature on Circumscription in Description Logics by investigating the tractability of conjunctive query answering in OWL2\u2019s profiles. It turns out that the data complexity of conjunctive query answering is coNP-hard in circumscribed EL\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathcal {E}{\\mathscr{L}}$\\end{document} and DL-lite, while in circumscribed OWL2-RL conjunctive queries retain their classical semantics. In an attempt to capture nonclassical inferences in OWL2-RL, we consider conjunctive queries with safe negation. They can detect some of the nonclassical consequences of circumscribed knowledge bases, but data complexity becomes coNP-hard. In circumscribed EL\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathcal {E}{\\mathscr{L}}$\\end{document}, answering queries with safe negation is undecidable.",
"genre": "article",
"id": "sg:pub.10.1007/s10472-021-09770-2",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": [
{
"id": "sg:journal.1043955",
"issn": [
"1012-2443",
"1573-7470"
],
"name": "Annals of Mathematics and Artificial Intelligence",
"publisher": "Springer Nature",
"type": "Periodical"
},
{
"issueNumber": "12",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "89"
}
],
"keywords": [
"conjunctive queries",
"data complexity",
"safe negation",
"conjunctive query answering",
"query answering",
"description logics",
"queries",
"OWL2 RL",
"knowledge bases",
"DL-Lite",
"classical semantics",
"complexity",
"Answering",
"semantics",
"logic",
"negation",
"tractability",
"inference",
"gap",
"basis",
"literature",
"attempt",
"profile",
"circumscription",
"consequences",
"paper"
],
"name": "Query answering in circumscribed OWL2 profiles",
"pagination": "1155-1173",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1140776801"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s10472-021-09770-2"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s10472-021-09770-2",
"https://app.dimensions.ai/details/publication/pub.1140776801"
],
"sdDataset": "articles",
"sdDatePublished": "2022-05-20T07:38",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_883.jsonl",
"type": "ScholarlyArticle",
"url": "https://doi.org/10.1007/s10472-021-09770-2"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10472-021-09770-2'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10472-021-09770-2'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10472-021-09770-2'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10472-021-09770-2'
This table displays all metadata directly associated to this object as RDF triples.
104 TRIPLES
22 PREDICATES
56 URIs
43 LITERALS
6 BLANK NODES