{"id":"https://openalex.org/W1889084950","doi":"https://doi.org/10.2168/lmcs-11(4:8)2015","title":"Faster Existential FO Model Checking on Posets","display_name":"Faster Existential FO Model Checking on Posets","publication_year":2015,"publication_date":"2015-12-11","ids":{"openalex":"https://openalex.org/W1889084950","doi":"https://doi.org/10.2168/lmcs-11(4:8)2015","mag":"1889084950"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(4:8)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:8)2015","pdf_url":"https://lmcs.episciences.org/1609/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1609/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jakub Gajarsk\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jakub Gajarsk\u00fd","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Petr Hlin\u011bn\u00fd","orcid":"https://orcid.org/0000-0003-2125-1514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr Hlin\u011bn\u00fd","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Jan Obdr\u017e\u00e1lek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Obdr\u017e\u00e1lek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick 68a, Brno, 62100, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick 68a, Brno, 62100, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7277,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73252385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 11, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4219000041484833,"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/T10142","display_name":"Formal Methods in Verification","score":0.4219000041484833,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2842000126838684,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11550000309944153,"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/fragment","display_name":"Fragment (logic)","score":0.6654999852180481},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.6557000279426575},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6394000053405762},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6158999800682068},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5855000019073486},{"id":"https://openalex.org/keywords/existentialism","display_name":"Existentialism","score":0.4316999912261963},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41519999504089355}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6654999852180481},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.6557000279426575},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6394000053405762},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6158999800682068},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5855000019073486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5228999853134155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4352000057697296},{"id":"https://openalex.org/C127882523","wikidata":"https://www.wikidata.org/wiki/Q38066","display_name":"Existentialism","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37049999833106995},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3449000120162964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33169999718666077},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2816999852657318},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2572000026702881},{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.25}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-11(4:8)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:8)2015","pdf_url":"https://lmcs.episciences.org/1609/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:arXiv.org:1409.4433","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.4433","pdf_url":"https://arxiv.org/pdf/1409.4433","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.742.254","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.742.254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1409.4433.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e74e826cd8944d8eb99047a874b26eba","is_oa":true,"landing_page_url":"https://doaj.org/article/e74e826cd8944d8eb99047a874b26eba","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 4 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(4:8)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:8)2015","pdf_url":"https://lmcs.episciences.org/1609/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":[{"id":"https://openalex.org/G1161296376","display_name":null,"funder_award_id":"14-03501S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G5553602548","display_name":null,"funder_award_id":"CZ.1.07/2.3.00/30.0009","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1889084950.pdf","grobid_xml":"https://content.openalex.org/works/W1889084950.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,91,131],"prove":[1],"that":[2,75],"the":[3,8,26,29,54,76,100,143],"model":[4,50,146],"checking":[5,51,147],"problem":[6,58,148],"for":[7,85],"existential":[9,77,144],"fragment":[10,78],"of":[11,31,37,46,56,79,88,102,110,117],"first-order":[12],"(FO)":[13],"logic":[14],"on":[15,52,59,107],"partially":[16],"ordered":[17],"sets":[18],"is":[19,42,105],"fixed-parameter":[20],"tractable":[21],"(FPT)":[22],"with":[23],"respect":[24],"to":[25,114,129],"formula":[27],"and":[28,69,121,127],"width":[30,111],"a":[32,43,86,139,152],"poset":[33,87],"(the":[34],"maximum":[35],"size":[36],"an":[38,82],"antichain).":[39],"While":[40],"there":[41],"long":[44],"line":[45],"research":[47],"into":[48],"FO":[49,80,145],"graphs,":[53],"study":[55],"this":[57,133],"posets":[60,109],"has":[61,81],"been":[62],"initiated":[63],"just":[64],"recently":[65],"by":[66,135],"Bova,":[67],"Ganian":[68],"Szeider":[70],"(CSL-LICS":[71],"2014),":[72],"who":[73],"proved":[74],"FPT":[83],"algorithm":[84,104],"fixed":[89],"width.":[90],"improve":[92],"upon":[93],"their":[94],"result":[95,134],"in":[96],"two":[97],"ways:":[98],"(1)":[99],"runtime":[101],"our":[103,123],"O(f(|{\\phi}|,w).n^2)":[106],"n-element":[108],"w,":[112],"compared":[113],"O(g(|{\\phi}|).":[115],"n^{h(w)})":[116],"Bova":[118],"et":[119],"al.,":[120],"(2)":[122],"proofs":[124],"are":[125],"simpler":[126],"easier":[128],"follow.":[130],"complement":[132],"showing":[136],"that,":[137],"under":[138],"certain":[140],"complexity-theoretical":[141],"assumption,":[142],"does":[149],"not":[150],"have":[151],"polynomial":[153],"kernel.":[154]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}