Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic Article Swipe
Agi Kurucz
,
Vladislav Ryzhikov
,
Yury Savateev
,
Michael Zakharyaschev
·
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2207.06210
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2207.06210
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) formulated in linear temporal logic LTL over (Z,<) and deciding whether it is rewritable to an FO(<)-query, possibly with some extra predicates. First, we observe that, in line with the circuit complexity and FO-definability of regular languages, OMQ answering in AC^0, ACC^0 and NC^1 coincides with FO(<,\equiv)-rewritability using unary predicates x \equiv 0 (mod n), FO(<,MOD)-rewritability, and FO(RPR)-rewritability using relational primitive recursion, respectively. We prove that, similarly to known PSPACE-completeness of recognising FO(<)-definability of regular languages, deciding FO(<,\equiv)- and FO(<,MOD)-definability is also \PSPACE-complete (unless ACC^0 = NC^1). We then use this result to show that deciding FO(<)-, FO(<,\equiv)- and FO(<,MOD)-rewritability of LTL OMQs is EXPSPACE-complete, and that these problems become PSPACE-complete for OMQs with a linear Horn ontology and an atomic query, and also a positive query in the cases of FO(<)- and FO(<,\equiv)-rewritability. Further, we consider FO(<)-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for which deciding it is PSPACE-, Pi_2^p- and coNP-complete.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2207.06210
- https://arxiv.org/pdf/2207.06210
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4285483635
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4285483635Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2207.06210Digital Object Identifier
- Title
-
Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal LogicWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-07-13Full publication date if available
- Authors
-
Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael ZakharyaschevList of authors in order
- Landing page
-
https://arxiv.org/abs/2207.06210Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2207.06210Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2207.06210Direct OA link when available
- Concepts
-
Unary operation, PSPACE, Mathematics, P, Time complexity, Discrete mathematics, Decidability, Temporal logic, Linear temporal logic, Combinatorics, Theoretical computer science, Computational complexity theory, Computer science, AlgorithmTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4285483635 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2207.06210 |
| ids.doi | https://doi.org/10.48550/arxiv.2207.06210 |
| ids.openalex | https://openalex.org/W4285483635 |
| fwci | 0.0 |
| type | preprint |
| title | Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10317 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9951000213623047 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Advanced Database Systems and Queries |
| topics[1].id | https://openalex.org/T10215 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9904000163078308 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Semantic Web and Ontologies |
| topics[2].id | https://openalex.org/T11010 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9901000261306763 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Logic, Reasoning, and Knowledge |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C78023250 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7119104862213135 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q657596 |
| concepts[0].display_name | Unary operation |
| concepts[1].id | https://openalex.org/C197685441 |
| concepts[1].level | 3 |
| concepts[1].score | 0.6991731524467468 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q500716 |
| concepts[1].display_name | PSPACE |
| concepts[2].id | https://openalex.org/C33923547 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5797942876815796 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[2].display_name | Mathematics |
| concepts[3].id | https://openalex.org/C134026603 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5072481036186218 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q846354 |
| concepts[3].display_name | P |
| concepts[4].id | https://openalex.org/C311688 |
| concepts[4].level | 2 |
| concepts[4].score | 0.48679205775260925 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2393193 |
| concepts[4].display_name | Time complexity |
| concepts[5].id | https://openalex.org/C118615104 |
| concepts[5].level | 1 |
| concepts[5].score | 0.4798973798751831 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[5].display_name | Discrete mathematics |
| concepts[6].id | https://openalex.org/C153269930 |
| concepts[6].level | 2 |
| concepts[6].score | 0.44594067335128784 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q430001 |
| concepts[6].display_name | Decidability |
| concepts[7].id | https://openalex.org/C25016198 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4207392930984497 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q781833 |
| concepts[7].display_name | Temporal logic |
| concepts[8].id | https://openalex.org/C4777664 |
| concepts[8].level | 2 |
| concepts[8].score | 0.41368070244789124 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1536492 |
| concepts[8].display_name | Linear temporal logic |
| concepts[9].id | https://openalex.org/C114614502 |
| concepts[9].level | 1 |
| concepts[9].score | 0.36047738790512085 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[9].display_name | Combinatorics |
| concepts[10].id | https://openalex.org/C80444323 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3540377616882324 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[10].display_name | Theoretical computer science |
| concepts[11].id | https://openalex.org/C179799912 |
| concepts[11].level | 2 |
| concepts[11].score | 0.3183576762676239 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q205084 |
| concepts[11].display_name | Computational complexity theory |
| concepts[12].id | https://openalex.org/C41008148 |
| concepts[12].level | 0 |
| concepts[12].score | 0.30767565965652466 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[12].display_name | Computer science |
| concepts[13].id | https://openalex.org/C11413529 |
| concepts[13].level | 1 |
| concepts[13].score | 0.2157973051071167 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[13].display_name | Algorithm |
| keywords[0].id | https://openalex.org/keywords/unary-operation |
| keywords[0].score | 0.7119104862213135 |
| keywords[0].display_name | Unary operation |
| keywords[1].id | https://openalex.org/keywords/pspace |
| keywords[1].score | 0.6991731524467468 |
| keywords[1].display_name | PSPACE |
| keywords[2].id | https://openalex.org/keywords/mathematics |
| keywords[2].score | 0.5797942876815796 |
| keywords[2].display_name | Mathematics |
| keywords[3].id | https://openalex.org/keywords/p |
| keywords[3].score | 0.5072481036186218 |
| keywords[3].display_name | P |
| keywords[4].id | https://openalex.org/keywords/time-complexity |
| keywords[4].score | 0.48679205775260925 |
| keywords[4].display_name | Time complexity |
| keywords[5].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[5].score | 0.4798973798751831 |
| keywords[5].display_name | Discrete mathematics |
| keywords[6].id | https://openalex.org/keywords/decidability |
| keywords[6].score | 0.44594067335128784 |
| keywords[6].display_name | Decidability |
| keywords[7].id | https://openalex.org/keywords/temporal-logic |
| keywords[7].score | 0.4207392930984497 |
| keywords[7].display_name | Temporal logic |
| keywords[8].id | https://openalex.org/keywords/linear-temporal-logic |
| keywords[8].score | 0.41368070244789124 |
| keywords[8].display_name | Linear temporal logic |
| keywords[9].id | https://openalex.org/keywords/combinatorics |
| keywords[9].score | 0.36047738790512085 |
| keywords[9].display_name | Combinatorics |
| keywords[10].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[10].score | 0.3540377616882324 |
| keywords[10].display_name | Theoretical computer science |
| keywords[11].id | https://openalex.org/keywords/computational-complexity-theory |
| keywords[11].score | 0.3183576762676239 |
| keywords[11].display_name | Computational complexity theory |
| keywords[12].id | https://openalex.org/keywords/computer-science |
| keywords[12].score | 0.30767565965652466 |
| keywords[12].display_name | Computer science |
| keywords[13].id | https://openalex.org/keywords/algorithm |
| keywords[13].score | 0.2157973051071167 |
| keywords[13].display_name | Algorithm |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2207.06210 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2207.06210 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2207.06210 |
| locations[1].id | doi:10.48550/arxiv.2207.06210 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article-journal |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2207.06210 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5038619560 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-6233-6277 |
| authorships[0].author.display_name | Agi Kurucz |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Kurucz, Agi |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5038062752 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-6847-6465 |
| authorships[1].author.display_name | Vladislav Ryzhikov |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ryzhikov, Vladislav |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5010357513 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-5112-4992 |
| authorships[2].author.display_name | Yury Savateev |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Savateev, Yury |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5001878365 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-2210-5183 |
| authorships[3].author.display_name | Michael Zakharyaschev |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Zakharyaschev, Michael |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2207.06210 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10317 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9951000213623047 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Advanced Database Systems and Queries |
| related_works | https://openalex.org/W3204615532, https://openalex.org/W2026191634, https://openalex.org/W4211259775, https://openalex.org/W2124110813, https://openalex.org/W2110302191, https://openalex.org/W4302143739, https://openalex.org/W2084686863, https://openalex.org/W1536078516, https://openalex.org/W2020230082, https://openalex.org/W2031528374 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2207.06210 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2207.06210 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2207.06210 |
| primary_location.id | pmh:oai:arXiv.org:2207.06210 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2207.06210 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2207.06210 |
| publication_date | 2022-07-13 |
| publication_year | 2022 |
| referenced_works_count | 0 |
| abstract_inverted_index.0 | 68 |
| abstract_inverted_index.= | 101 |
| abstract_inverted_index.a | 130, 140, 157 |
| abstract_inverted_index.x | 66 |
| abstract_inverted_index.We | 79, 103 |
| abstract_inverted_index.an | 12, 31, 135 |
| abstract_inverted_index.in | 17, 42, 55, 143 |
| abstract_inverted_index.is | 2, 28, 96, 119, 168 |
| abstract_inverted_index.it | 27, 167 |
| abstract_inverted_index.of | 5, 10, 50, 86, 89, 116, 146, 154 |
| abstract_inverted_index.to | 30, 83, 108 |
| abstract_inverted_index.we | 39, 151 |
| abstract_inverted_index.LTL | 21, 117 |
| abstract_inverted_index.OMQ | 53, 162 |
| abstract_inverted_index.Our | 0 |
| abstract_inverted_index.and | 24, 48, 58, 72, 94, 114, 121, 134, 138, 148, 160, 171 |
| abstract_inverted_index.for | 127, 164 |
| abstract_inverted_index.n), | 70 |
| abstract_inverted_index.the | 3, 7, 45, 144 |
| abstract_inverted_index.use | 105 |
| abstract_inverted_index.(mod | 69 |
| abstract_inverted_index.Horn | 132 |
| abstract_inverted_index.NC^1 | 59 |
| abstract_inverted_index.OMQs | 118, 128, 155 |
| abstract_inverted_index.also | 97, 139 |
| abstract_inverted_index.data | 8 |
| abstract_inverted_index.line | 43 |
| abstract_inverted_index.over | 22 |
| abstract_inverted_index.show | 109 |
| abstract_inverted_index.some | 35 |
| abstract_inverted_index.that | 110, 122 |
| abstract_inverted_index.then | 104 |
| abstract_inverted_index.this | 106 |
| abstract_inverted_index.with | 34, 44, 61, 129, 156 |
| abstract_inverted_index.(OMQ) | 15 |
| abstract_inverted_index.ACC^0 | 57, 100 |
| abstract_inverted_index.AC^0, | 56 |
| abstract_inverted_index.cases | 145 |
| abstract_inverted_index.extra | 36 |
| abstract_inverted_index.known | 84 |
| abstract_inverted_index.logic | 20 |
| abstract_inverted_index.prove | 80 |
| abstract_inverted_index.query | 14, 142 |
| abstract_inverted_index.that, | 41, 81 |
| abstract_inverted_index.these | 123 |
| abstract_inverted_index.unary | 64 |
| abstract_inverted_index.using | 63, 74 |
| abstract_inverted_index.which | 165 |
| abstract_inverted_index.First, | 38 |
| abstract_inverted_index.NC^1). | 102 |
| abstract_inverted_index.\equiv | 67 |
| abstract_inverted_index.atomic | 136 |
| abstract_inverted_index.become | 125 |
| abstract_inverted_index.linear | 18, 131 |
| abstract_inverted_index.query, | 137 |
| abstract_inverted_index.result | 107 |
| abstract_inverted_index.(unless | 99 |
| abstract_inverted_index.Pi_2^p- | 170 |
| abstract_inverted_index.circuit | 46 |
| abstract_inverted_index.concern | 1 |
| abstract_inverted_index.observe | 40 |
| abstract_inverted_index.problem | 4 |
| abstract_inverted_index.regular | 51, 90 |
| abstract_inverted_index.whether | 26 |
| abstract_inverted_index.(Z,<) | 23 |
| abstract_inverted_index.Further, | 150 |
| abstract_inverted_index.PSPACE-, | 169 |
| abstract_inverted_index.classes, | 163 |
| abstract_inverted_index.consider | 152 |
| abstract_inverted_index.deciding | 25, 92, 111, 166 |
| abstract_inverted_index.identify | 161 |
| abstract_inverted_index.ontology | 133, 159 |
| abstract_inverted_index.positive | 141 |
| abstract_inverted_index.possibly | 33 |
| abstract_inverted_index.problems | 124 |
| abstract_inverted_index.temporal | 19 |
| abstract_inverted_index.FO(<)- | 147 |
| abstract_inverted_index.answering | 11, 54 |
| abstract_inverted_index.coincides | 60 |
| abstract_inverted_index.primitive | 76 |
| abstract_inverted_index.similarly | 82 |
| abstract_inverted_index.FO(<)-, | 112 |
| abstract_inverted_index.complexity | 9, 47 |
| abstract_inverted_index.formulated | 16 |
| abstract_inverted_index.languages, | 52, 91 |
| abstract_inverted_index.predicates | 65 |
| abstract_inverted_index.recursion, | 77 |
| abstract_inverted_index.relational | 75 |
| abstract_inverted_index.rewritable | 29 |
| abstract_inverted_index.determining | 6 |
| abstract_inverted_index.predicates. | 37 |
| abstract_inverted_index.recognising | 87 |
| abstract_inverted_index.binary-clause | 158 |
| abstract_inverted_index.respectively. | 78 |
| abstract_inverted_index.coNP-complete. | 172 |
| abstract_inverted_index.FO(<)-query, | 32 |
| abstract_inverted_index.FO-definability | 49 |
| abstract_inverted_index.PSPACE-complete | 126 |
| abstract_inverted_index.FO(<,\equiv)- | 93, 113 |
| abstract_inverted_index.\PSPACE-complete | 98 |
| abstract_inverted_index.ontology-mediated | 13 |
| abstract_inverted_index.EXPSPACE-complete, | 120 |
| abstract_inverted_index.PSPACE-completeness | 85 |
| abstract_inverted_index.FO(<)-definability | 88 |
| abstract_inverted_index.FO(RPR)-rewritability | 73 |
| abstract_inverted_index.FO(<)-rewritability | 153 |
| abstract_inverted_index.FO(<,MOD)-definability | 95 |
| abstract_inverted_index.FO(<,MOD)-rewritability | 115 |
| abstract_inverted_index.FO(<,MOD)-rewritability, | 71 |
| abstract_inverted_index.FO(<,\equiv)-rewritability | 62 |
| abstract_inverted_index.FO(<,\equiv)-rewritability. | 149 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/4 |
| sustainable_development_goals[0].score | 0.4099999964237213 |
| sustainable_development_goals[0].display_name | Quality Education |
| citation_normalized_percentile.value | 0.08857149 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |