{"id":"https://openalex.org/W2171053521","doi":"https://doi.org/10.23638/lmcs-14(4:10)2018","title":"Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?","display_name":"Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?","publication_year":2018,"publication_date":"2018-10-31","ids":{"openalex":"https://openalex.org/W2171053521","doi":"https://doi.org/10.23638/lmcs-14(4:10)2018","mag":"2171053521"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-14(4:10)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:10)2018","pdf_url":"https://lmcs.episciences.org/4941/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","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4941/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090333344","display_name":"Nadia Creignou","orcid":"https://orcid.org/0009-0005-6522-6363"},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nadia Creignou","raw_affiliation_strings":["Laboratoire d'informatique Fondamentale de Marseille"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique Fondamentale de Marseille","institution_ids":["https://openalex.org/I4210115196"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091683403","display_name":"Reinhard Pichler","orcid":"https://orcid.org/0000-0002-1760-122X"},"institutions":[{"id":"https://openalex.org/I4210147455","display_name":"Institute of Information Science","ror":"https://ror.org/055q8rh54","country_code":"SI","type":"education","lineage":["https://openalex.org/I4210147455"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Reinhard Pichler","raw_affiliation_strings":["Institute of Information Systems"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Systems","institution_ids":["https://openalex.org/I4210147455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006053030","display_name":"Stefan Woltran","orcid":"https://orcid.org/0000-0003-1594-8972"},"institutions":[{"id":"https://openalex.org/I4210147455","display_name":"Institute of Information Science","ror":"https://ror.org/055q8rh54","country_code":"SI","type":"education","lineage":["https://openalex.org/I4210147455"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Stefan Woltran","raw_affiliation_strings":["Institute of Information Systems"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Systems","institution_ids":["https://openalex.org/I4210147455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1867,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.61289756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"Volume 14, 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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9969000220298767,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9965000152587891,"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.8418538570404053},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7521997690200806},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6706387996673584},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6562455296516418},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5239351391792297},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5073406100273132},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.435871958732605},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.4187451899051666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4064685106277466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3863009810447693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3677482306957245},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36026373505592346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.311935693025589}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8418538570404053},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7521997690200806},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6706387996673584},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6562455296516418},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5239351391792297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5073406100273132},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.435871958732605},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.4187451899051666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4064685106277466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3863009810447693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3677482306957245},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36026373505592346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.311935693025589},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-14(4:10)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:10)2018","pdf_url":"https://lmcs.episciences.org/4941/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:1711.07786","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.07786","pdf_url":"https://arxiv.org/pdf/1711.07786","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":"doi:10.48550/arxiv.1711.07786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.07786","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-14(4:10)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:10)2018","pdf_url":"https://lmcs.episciences.org/4941/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":[{"score":0.8399999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G8515446080","display_name":"Fixed-Parameter Tractability in Artificial Intelligence and Reasoning (FAIR)","funder_award_id":"P25518","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320323942","display_name":"Campus France","ror":"https://ror.org/04wtce741"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2171053521.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W45851868","https://openalex.org/W68974267","https://openalex.org/W1487936617","https://openalex.org/W1576985811","https://openalex.org/W1967138724","https://openalex.org/W1982345710","https://openalex.org/W1991034379","https://openalex.org/W2025319967","https://openalex.org/W2032312337","https://openalex.org/W2035877205","https://openalex.org/W2055356006","https://openalex.org/W2067510576","https://openalex.org/W2068190866","https://openalex.org/W2072181151","https://openalex.org/W2100657934","https://openalex.org/W2113666441","https://openalex.org/W2131202479","https://openalex.org/W2133260738","https://openalex.org/W2149922426","https://openalex.org/W2166566648"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W2014111643","https://openalex.org/W3107131366","https://openalex.org/W2571882453","https://openalex.org/W4211028879","https://openalex.org/W2076399409","https://openalex.org/W3128448798","https://openalex.org/W4248235708","https://openalex.org/W2408080066","https://openalex.org/W1608133301"],"abstract_inverted_index":{"Many":[0],"reasoning":[1,115],"problems":[2],"are":[3],"based":[4],"on":[5],"the":[6,18,21,27,40,69,86,112,130,150,166],"problem":[7,42,65,152],"of":[8,20,62,107,114,139,165,169],"satisfiability":[9],"(SAT).":[10],"While":[11],"SAT":[12],"itself":[13],"becomes":[14],"easy":[15,67],"when":[16],"restricting":[17],"structure":[19],"formulas":[22,93,134,160],"in":[23,58,77,94,117,127,141],"a":[24,46,137,162],"certain":[25],"way,":[26],"situation":[28],"is":[29,56,66,90],"more":[30,33],"opaque":[31],"for":[32,68,85],"involved":[34],"decision":[35],"problems.":[36,171],"We":[37,103,146],"consider":[38,149],"here":[39],"CardMinSat":[41,151],"which":[43],"asks,":[44],"given":[45,91],"propositional":[47],"formula":[48],"$\\phi$":[49],"and":[50,120,123],"an":[51],"atom":[52],"$x$,":[53],"whether":[54],"$x$":[55],"true":[57],"some":[59,128],"cardinality-minimal":[60],"model":[61],"$\\phi$.":[63],"This":[64],"Horn":[70],"fragment,":[71],"but,":[72],"as":[73],"we":[74],"will":[75,104],"show":[76,124],"this":[78,108],"paper,":[79],"remains":[80],"$\\Theta_2$-complete":[81],"(and":[82],"thus":[83,147],"$\\mathrm{NP}$-hard)":[84],"Krom":[87,133,159],"fragment":[88],"(which":[89],"by":[92],"CNF":[95],"where":[96],"clauses":[97],"have":[98],"at":[99],"most":[100],"two":[101],"literals).":[102],"make":[105],"use":[106],"fact":[109],"to":[110,132,136,155,158],"study":[111],"complexity":[113],"tasks":[116],"belief":[118],"revision":[119],"logic-based":[121],"abduction":[122],"that,":[125],"while":[126],"cases":[129],"restriction":[131],"leads":[135],"decrease":[138],"complexity,":[140],"others":[142],"it":[143],"does":[144],"not.":[145],"also":[148],"with":[153],"respect":[154],"additional":[156],"restrictions":[157],"towards":[161],"better":[163],"understanding":[164],"tractability":[167],"frontier":[168],"such":[170]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}