{"id":"https://openalex.org/W4309192670","doi":"https://doi.org/10.1017/s1471068422000400","title":"Unifying Framework for Optimizations in Non-Boolean Formalisms","display_name":"Unifying Framework for Optimizations in Non-Boolean Formalisms","publication_year":2022,"publication_date":"2022-11-15","ids":{"openalex":"https://openalex.org/W4309192670","doi":"https://doi.org/10.1017/s1471068422000400"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068422000400","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068422000400","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008816972","display_name":"Yuliya Lierler","orcid":"https://orcid.org/0000-0002-6146-623X"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"YULIYA LIERLER","raw_affiliation_strings":["University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-6146-623X","affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail:","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008816972"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.1387,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56025707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"6","first_page":"1248","last_page":"1280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9958000183105469,"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.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7887715101242065},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5379382371902466},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.5140477418899536},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5112709999084473},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.47937896847724915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4473079741001129},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.44495901465415955},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4263908863067627},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4164496660232544},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13767531514167786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1240052580833435}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7887715101242065},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5379382371902466},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5140477418899536},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5112709999084473},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.47937896847724915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4473079741001129},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.44495901465415955},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4263908863067627},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4164496660232544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13767531514167786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1240052580833435},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068422000400","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068422000400","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W89175885","https://openalex.org/W1552168992","https://openalex.org/W1694306392","https://openalex.org/W1934765622","https://openalex.org/W2069323107","https://openalex.org/W2089928029","https://openalex.org/W2139922246","https://openalex.org/W2155378065","https://openalex.org/W2180614101","https://openalex.org/W2593721831","https://openalex.org/W2887456647","https://openalex.org/W2888107106","https://openalex.org/W2912640545","https://openalex.org/W2962851569","https://openalex.org/W3159185321","https://openalex.org/W4282962818","https://openalex.org/W6603669909","https://openalex.org/W6682269659","https://openalex.org/W6683303659","https://openalex.org/W6732635222","https://openalex.org/W6753533608","https://openalex.org/W6771676130"],"related_works":["https://openalex.org/W2952134500","https://openalex.org/W1761011694","https://openalex.org/W2460803124","https://openalex.org/W2748658279","https://openalex.org/W4298442682","https://openalex.org/W2002758009","https://openalex.org/W2588494373","https://openalex.org/W2912714455","https://openalex.org/W3195436951","https://openalex.org/W1546293312"],"abstract_inverted_index":{"Abstract":[0],"Search-optimization":[1],"problems":[2],"are":[3,38,44],"plentiful":[4],"in":[5,47,79,82],"scientific":[6],"and":[7,22,29,35,115],"engineering":[8],"domains.":[9],"Artificial":[10],"intelligence":[11],"(AI)":[12],"has":[13],"long":[14],"contributed":[15],"to":[16,111],"the":[17,39,132],"development":[18],"of":[19,41,97,131,141],"search":[20],"algorithms":[21],"declarative":[23],"programming":[24],"languages":[25,58,81],"geared":[26],"toward":[27],"solving":[28],"modeling":[30],"search-optimization":[31],"problems.":[32],"Automated":[33],"reasoning":[34,53,124],"knowledge":[36],"representation":[37],"subfields":[40],"AI":[42],"that":[43,102,135,143],"particularly":[45],"vested":[46],"these":[48],"developments.":[49],"Many":[50],"popular":[51],"automated":[52,123],"paradigms":[54,76,142],"provide":[55],"users":[56],"with":[57],"supporting":[59],"optimization":[60,67,118],"statements.":[61],"Recall":[62],"integer":[63],"linear":[64],"programming,":[65],"MaxSAT,":[66],"satisfiability":[68],"modulo":[69],"theory,":[70],"(constraint)":[71],"answer":[72],"set":[73],"programming.":[74],"These":[75],"vary":[77],"significantly":[78],"their":[80],"ways":[83],"they":[84],"express":[85],"quality":[86],"conditions":[87],"on":[88],"computed":[89],"solutions.":[90],"Here":[91],"we":[92],"propose":[93],"a":[94],"unifying":[95],"framework":[96],"so-called":[98],"extended":[99],"weight":[100],"systems":[101,134],"eliminates":[103],"syntactic":[104],"distinctions":[105],"between":[106,117],"paradigms.":[107],"They":[108],"allow":[109],"us":[110],"see":[112],"essential":[113],"similarities":[114],"differences":[116],"statements":[119],"provided":[120],"by":[121],"distinct":[122],"languages.":[125],"We":[126],"also":[127],"study":[128],"formal":[129,139],"properties":[130,140],"proposed":[133],"immediately":[136],"translate":[137],"into":[138],"can":[144],"be":[145],"captured":[146],"within":[147],"our":[148],"framework.":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}