{"id":"https://openalex.org/W2955897080","doi":"https://doi.org/10.24963/ijcai.2019/212","title":"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting","display_name":"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2955897080","doi":"https://doi.org/10.24963/ijcai.2019/212","mag":"2955897080"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/212","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/212","pdf_url":"https://www.ijcai.org/proceedings/2019/0212.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0212.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054499021","display_name":"Bartosz Bednarczyk","orcid":"https://orcid.org/0000-0002-8267-7554"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]},{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["CZ","DE","PL"],"is_corresponding":true,"raw_author_name":"Bartosz Bednarczyk","raw_affiliation_strings":["Computational Logic Group, TU Dresden","Institute of Computer Science, University of Wroc\u0142aw"],"affiliations":[{"raw_affiliation_string":"Computational Logic Group, TU Dresden","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210155092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024774718","display_name":"Sebastian Rudolph","orcid":"https://orcid.org/0000-0002-1609-2080"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Rudolph","raw_affiliation_strings":["Computational Logic Group, TU Dresden"],"affiliations":[{"raw_affiliation_string":"Computational Logic Group, TU Dresden","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054499021"],"corresponding_institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210155092","https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.42,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70457874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1530","last_page":"1536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8886359333992004},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7257651686668396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5328640937805176},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30102020502090454}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8886359333992004},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7257651686668396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5328640937805176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30102020502090454}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2019/212","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/212","pdf_url":"https://www.ijcai.org/proceedings/2019/0212.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"mag:2955897080","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/212","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/212","pdf_url":"https://www.ijcai.org/proceedings/2019/0212.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2955897080.pdf","grobid_xml":"https://content.openalex.org/works/W2955897080.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W166892013","https://openalex.org/W1483388050","https://openalex.org/W1727181597","https://openalex.org/W2127347809","https://openalex.org/W2339264483","https://openalex.org/W2402661933","https://openalex.org/W2572769649","https://openalex.org/W2951982224"],"related_works":["https://openalex.org/W2966628624","https://openalex.org/W2092103258","https://openalex.org/W2153564808","https://openalex.org/W1509623480","https://openalex.org/W1517205743","https://openalex.org/W1569742446","https://openalex.org/W2206197098","https://openalex.org/W3174909990","https://openalex.org/W2597710487","https://openalex.org/W748364857","https://openalex.org/W1524062755","https://openalex.org/W2020437202","https://openalex.org/W2963617137","https://openalex.org/W110865114","https://openalex.org/W2233931102","https://openalex.org/W1515406934","https://openalex.org/W1997520998","https://openalex.org/W1494082465","https://openalex.org/W2404737747","https://openalex.org/W1989267168"],"abstract_inverted_index":{"Among":[0],"the":[1,8,12,34,64,106],"most":[2],"expressive":[3,96],"knowledge":[4,77],"representation":[5],"formalisms":[6],"are":[7],"description":[9,97],"logics":[10],"of":[11,18,21,36,39,66,110],"Z":[13],"family.":[14],"For":[15],"well-behaved":[16],"fragments":[17],"ZOIQ,":[19],"entailment":[20,75,89,122],"positive":[22],"two-way":[23],"regular":[24],"path":[25],"queries":[26],"is":[27],"well":[28],"known":[29],"to":[30,76,83,104],"be":[31,50,60],"2EXPTIME-complete":[32],"under":[33],"proviso":[35],"unary":[37],"encoding":[38],"numbers":[40],"in":[41,55,94],"cardinality":[42],"constraints.":[43],"We":[44],"show":[45],"that":[46],"this":[47],"assumption":[48],"can":[49,59],"dropped":[51],"without":[52],"an":[53],"increase":[54],"complexity":[56],"and":[57,90],"EXPTIME-completeness":[58],"achieved":[61],"when":[62],"bounding":[63],"number":[65],"query":[67,74,88,91,121],"atoms,":[68],"using":[69],"a":[70],"novel":[71],"reduction":[72],"from":[73],"base":[78],"satisfiability.":[79],"These":[80],"findings":[81],"allow":[82],"strengthen":[84],"other":[85],"results":[86,100],"regarding":[87],"containment":[92],"problems":[93],"very":[95],"logics.":[98],"Our":[99],"also":[101],"carry":[102],"over":[103],"GC2,":[105],"two-variable":[107],"guarded":[108],"fragment":[109],"first-order":[111],"logic":[112],"with":[113],"counting":[114],"quantifiers,":[115],"for":[116],"which":[117],"hitherto":[118],"only":[119],"conjunctive":[120],"has":[123],"been":[124],"investigated.":[125]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}