{"id":"https://openalex.org/W4409684690","doi":"https://doi.org/10.46298/lmcs-21(2:7)2025","title":"Decidability of Querying First-Order Theories via Countermodels of Finite Width","display_name":"Decidability of Querying First-Order Theories via Countermodels of Finite Width","publication_year":2025,"publication_date":"2025-04-22","ids":{"openalex":"https://openalex.org/W4409684690","doi":"https://doi.org/10.46298/lmcs-21(2:7)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:7)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:7)2025","pdf_url":"https://lmcs.episciences.org/15535/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15535/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069038621","display_name":"Thomas Feller","orcid":"https://orcid.org/0000-0001-8420-6118"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Feller","raw_affiliation_strings":["Technische Universitt Dresden , Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universitt Dresden , Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045993299","display_name":"Tim S. Lyon","orcid":"https://orcid.org/0000-0003-3214-0828"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim S. Lyon","raw_affiliation_strings":["Technische Universitt Dresden , Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universitt Dresden , Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061160726","display_name":"Piotr Ostropolski-Nalewaja","orcid":"https://orcid.org/0000-0002-8021-1638"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Piotr Ostropolski-Nalewaja","raw_affiliation_strings":["Technische Universitt Dresden , Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universitt Dresden , Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"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":"Technische Universit\u00e4t 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":["Technische Universitt Dresden , Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universitt Dresden , Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069038621"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09532629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9358999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9358999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/decidability","display_name":"Decidability","score":0.8909091353416443},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.630020022392273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5595166087150574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3709421157836914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3570272624492645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32515111565589905}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8909091353416443},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.630020022392273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5595166087150574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3709421157836914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3570272624492645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32515111565589905},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(2:7)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:7)2025","pdf_url":"https://lmcs.episciences.org/15535/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8e50bd0e0bb244ca9e8b1d32b391f684","is_oa":true,"landing_page_url":"https://doaj.org/article/8e50bd0e0bb244ca9e8b1d32b391f684","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 2 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:7)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:7)2025","pdf_url":"https://lmcs.episciences.org/15535/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409684690.pdf","grobid_xml":"https://content.openalex.org/works/W4409684690.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2972379433","https://openalex.org/W2440791454","https://openalex.org/W4297670065","https://openalex.org/W1618267488","https://openalex.org/W1543051890","https://openalex.org/W2611810425","https://openalex.org/W4205250428","https://openalex.org/W1563786920","https://openalex.org/W2056142535"],"abstract_inverted_index":{"We":[0,149],"propose":[1,87],"a":[2,10,65,72,81,116,143],"generic":[3],"framework":[4],"for":[5,64,153,168],"establishing":[6],"the":[7,22,110,155],"decidability":[8],"of":[9,13,24,34,49,68,75,112,125,138,146,157],"wide":[11,66,144],"range":[12,67,145],"logical":[14],"entailment":[15,63],"problems":[16],"(briefly":[17],"called":[18],"querying),":[19],"based":[20],"on":[21,109],"existence":[23],"countermodels":[25],"that":[26],"are":[27],"structurally":[28],"simple,":[29],"gauged":[30],"by":[31],"certain":[32],"types":[33],"width":[35,84,98],"measures":[36,99],"(with":[37],"treewidth":[38],"and":[39,100,105,164],"cliquewidth":[40],"as":[41,115],"popular":[42,117],"examples).":[43],"As":[44,80],"an":[45],"important":[46],"special":[47],"case":[48],"our":[50,162],"framework,":[51],"we":[52,86,119],"identify":[53],"logics":[54],"exhibiting":[55],"width-finite":[56],"finitely":[57],"universal":[58],"model":[59],"sets,":[60],"warranting":[61],"decidable":[62,131],"homomorphism-closed":[69],"queries,":[70],"subsuming":[71],"diverse":[73],"set":[74],"practically":[76],"relevant":[77],"query":[78],"languages.":[79],"particularly":[82],"powerful":[83],"measure,":[85],"to":[88],"employ":[89],"Blumensath's":[90],"partitionwidth,":[91],"which":[92],"subsumes":[93],"various":[94],"other":[95,128],"commonly":[96],"considered":[97],"exhibits":[101],"highly":[102],"favorable":[103],"computational":[104],"structural":[106],"properties.":[107],"Focusing":[108],"formalism":[111],"existential":[113],"rules":[114,126],"showcase,":[118],"explain":[120],"how":[121],"finite":[122,158],"partitionwidth":[123],"sets":[124,160],"subsume":[127],"known":[129],"abstract":[130],"classes":[132],"but":[133],"-":[134,140],"leveraging":[135],"existing":[136],"notions":[137],"stratification":[139],"also":[141],"cover":[142],"new":[147],"rulesets.":[148],"expose":[150],"natural":[151],"limitations":[152],"fitting":[154],"class":[156],"unification":[159],"into":[161],"picture":[163],"suggest":[165],"several":[166],"options":[167],"remedy.":[169]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}