{"id":"https://openalex.org/W2916261673","doi":"https://doi.org/10.1145/3301410","title":"The Complexity of Minimal Inference Problem for Conservative Constraint Languages","display_name":"The Complexity of Minimal Inference Problem for Conservative Constraint Languages","publication_year":2019,"publication_date":"2019-02-18","ids":{"openalex":"https://openalex.org/W2916261673","doi":"https://doi.org/10.1145/3301410","mag":"2916261673"},"language":"en","primary_location":{"id":"doi:10.1145/3301410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301410","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ruj.uj.edu.pl/xmlui/handle/item/72612","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078579181","display_name":"Micha\u0142 Wrona","orcid":"https://orcid.org/0000-0002-2723-0768"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Micha\u0142 Wrona","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078579181"],"corresponding_institution_ids":["https://openalex.org/I126596746"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01552221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"2","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","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/T11010","display_name":"Logic, Reasoning, and Knowledge","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9927999973297119,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7980996370315552},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5771809816360474},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5673587322235107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5657798051834106},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.500896692276001},{"id":"https://openalex.org/keywords/circumscription","display_name":"Circumscription","score":0.46857571601867676},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4546244442462921},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44485634565353394},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4373803734779358},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43408453464508057},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4306766986846924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42476311326026917},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4163901209831238},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4100649356842041},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39823752641677856},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3058880567550659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29779669642448425},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18952679634094238}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7980996370315552},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5771809816360474},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5673587322235107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5657798051834106},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.500896692276001},{"id":"https://openalex.org/C62360110","wikidata":"https://www.wikidata.org/wiki/Q96777007","display_name":"Circumscription","level":2,"score":0.46857571601867676},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4546244442462921},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44485634565353394},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4373803734779358},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43408453464508057},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4306766986846924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42476311326026917},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4163901209831238},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4100649356842041},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39823752641677856},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3058880567550659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29779669642448425},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18952679634094238},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3301410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301410","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/72612","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/72612","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ruj.uj.edu.pl:item/72612","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/72612","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W75175369","https://openalex.org/W108355652","https://openalex.org/W1482410934","https://openalex.org/W1595267564","https://openalex.org/W1967190838","https://openalex.org/W1984074081","https://openalex.org/W1997649256","https://openalex.org/W1998363560","https://openalex.org/W2002476082","https://openalex.org/W2008294142","https://openalex.org/W2020154454","https://openalex.org/W2024430355","https://openalex.org/W2026753685","https://openalex.org/W2032487621","https://openalex.org/W2052726983","https://openalex.org/W2083568285","https://openalex.org/W2083810385","https://openalex.org/W2093461317","https://openalex.org/W2116407296","https://openalex.org/W2121804749","https://openalex.org/W2127045103","https://openalex.org/W2129495182","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2168335621","https://openalex.org/W2172276559","https://openalex.org/W2398609546","https://openalex.org/W2724239465","https://openalex.org/W2945259913","https://openalex.org/W2962785950","https://openalex.org/W2963768895"],"related_works":["https://openalex.org/W1834737061","https://openalex.org/W1588550661","https://openalex.org/W2473293107","https://openalex.org/W6135152","https://openalex.org/W2267494348","https://openalex.org/W1539117866","https://openalex.org/W2123481932","https://openalex.org/W2394942112","https://openalex.org/W2953319076","https://openalex.org/W2964237202"],"abstract_inverted_index":{"We":[0,58,99],"study":[1],"the":[2,5,34,37,49,52,63,105,142,151],"complexity":[3,32,50],"of":[4,22,33,51,62,69,96,129,133,141,159],"inference":[6,13,153],"problem":[7,20,35,53,64,106,154],"for":[8,36,125,155],"propositional":[9],"circumscription":[10],"(the":[11],"minimal":[12,152],"problem)":[14],"over":[15,54],"arbitrary":[16],"finite":[17],"domains.":[18],"The":[19,31,117],"is":[21,93,107,119],"fundamental":[23],"importance":[24],"in":[25,102,115],"nonmonotonic":[26],"logics":[27],"and":[28,84,144],"commonsense":[29],"reasoning.":[30],"two-element":[38],"domain":[39],"has":[40],"been":[41],"completely":[42],"classified.":[43],"In":[44],"this":[45,103],"article,":[46],"we":[47,76],"classify":[48],"all":[55],"conservative":[56],"languages.":[57,160],"consider":[59],"a":[60,67,81,86,94,122,126,145,156],"version":[61],"parameterized":[65],"by":[66],"set":[68],"relations":[70],"(a":[71],"constraint":[72],"language),":[73],"from":[74],"which":[75],"are":[77],"allowed":[78],"to":[79,90],"build":[80],"knowledge":[82],"base,":[83],"where":[85],"linear":[87],"order":[88],"used":[89],"compare":[91],"models":[92],"part":[95],"an":[97,131],"input.":[98],"show":[100],"that":[101,135],"setting":[104],"either":[108],"\u03a0":[109],"P":[110],"2":[111],"-complete,":[112],"coNP-complete,":[113],"or":[114],"P.":[116],"classification":[118],"based":[120],"on":[121],"coNP-hardness":[123],"proof":[124],"new":[127,146],"class":[128,158],"languages,":[130],"analysis":[132],"languages":[134],"do":[136],"not":[137],"express":[138],"any":[139],"member":[140],"class,":[143],"general":[147],"polynomial-time":[148],"algorithm":[149],"solving":[150],"large":[157]},"counts_by_year":[],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}