{"id":"https://openalex.org/W2066287719","doi":"https://doi.org/10.1017/s1471068403001819","title":"Strong equivalence made easy: nested expressions and weight constraints","display_name":"Strong equivalence made easy: nested expressions and weight constraints","publication_year":2003,"publication_date":"2003-07-01","ids":{"openalex":"https://openalex.org/W2066287719","doi":"https://doi.org/10.1017/s1471068403001819","mag":"2066287719"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068403001819","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068403001819","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D58055F8584F124C410BCFB4966A9DC0/S1471068403001819a.pdf/div-class-title-strong-equivalence-made-easy-nested-expressions-and-weight-constraints-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D58055F8584F124C410BCFB4966A9DC0/S1471068403001819a.pdf/div-class-title-strong-equivalence-made-easy-nested-expressions-and-weight-constraints-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084281533","display_name":"Hudson Turner","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HUDSON TURNER","raw_affiliation_strings":["Computer Science Department, University of Minnesota, Duluth, MN, USA (e-mail:","Computer Science Department, University of Minnesota, Duluth, MN, USA (e-mail: hudson@d.umn.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Duluth, MN, USA (e-mail:","institution_ids":["https://openalex.org/I4210115145"]},{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Duluth, MN, USA (e-mail: hudson@d.umn.edu)#TAB#","institution_ids":["https://openalex.org/I4210115145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084281533"],"corresponding_institution_ids":["https://openalex.org/I4210115145"],"apc_list":null,"apc_paid":null,"fwci":13.934,"has_fulltext":true,"cited_by_count":140,"citation_normalized_percentile":{"value":0.98827478,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"3","issue":"4+5","first_page":"609","last_page":"622"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9954000115394592,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9879999756813049,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.8014145493507385},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.6495991945266724},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.6280325055122375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179082989692688},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5756238698959351},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.5633784532546997},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5279192924499512},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5060567259788513},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.42889297008514404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4280155599117279},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42665958404541016},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4192378520965576},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36172449588775635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33758604526519775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31026339530944824},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.2289232611656189},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1560998260974884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13977262377738953},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.13926059007644653}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8014145493507385},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.6495991945266724},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.6280325055122375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179082989692688},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5756238698959351},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.5633784532546997},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5279192924499512},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5060567259788513},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.42889297008514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4280155599117279},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42665958404541016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4192378520965576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36172449588775635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33758604526519775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31026339530944824},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2289232611656189},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1560998260974884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13977262377738953},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.13926059007644653},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s1471068403001819","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068403001819","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D58055F8584F124C410BCFB4966A9DC0/S1471068403001819a.pdf/div-class-title-strong-equivalence-made-easy-nested-expressions-and-weight-constraints-div.pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.6455","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.d.umn.edu/~hudson/papers/seme7.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.1326","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.d.umn.edu/~hudson/seme6.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.6901","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.6901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.d.umn.edu/~hudson/seme4.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.2736","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.d.umn.edu/~hudson/seme3.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s1471068403001819","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068403001819","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D58055F8584F124C410BCFB4966A9DC0/S1471068403001819a.pdf/div-class-title-strong-equivalence-made-easy-nested-expressions-and-weight-constraints-div.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5636757343","display_name":"CAREER: Causal Theories of Action for AI Planning","funder_award_id":"0091773","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320314997","display_name":"Strong","ror":"https://ror.org/041vyzr56"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2066287719.pdf","grobid_xml":"https://content.openalex.org/works/W2066287719.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W189303310","https://openalex.org/W1511711492","https://openalex.org/W1549628945","https://openalex.org/W1566723378","https://openalex.org/W1567252621","https://openalex.org/W1577827016","https://openalex.org/W1582663744","https://openalex.org/W1586434992","https://openalex.org/W1601153438","https://openalex.org/W1694306392","https://openalex.org/W1985274317","https://openalex.org/W2076698873","https://openalex.org/W2078578754","https://openalex.org/W2087563242","https://openalex.org/W2155322595","https://openalex.org/W6607722874","https://openalex.org/W6630458657","https://openalex.org/W6646551422","https://openalex.org/W6670341996","https://openalex.org/W6672462522","https://openalex.org/W6682919253"],"related_works":["https://openalex.org/W2176973685","https://openalex.org/W1607801167","https://openalex.org/W2529281881","https://openalex.org/W2124627636","https://openalex.org/W2597189952","https://openalex.org/W1484108514","https://openalex.org/W1575307414","https://openalex.org/W1523341975","https://openalex.org/W1512767","https://openalex.org/W1556363336"],"abstract_inverted_index":{"Logic":[0],"programs":[1,70,109,130,182],"and":[2,53,95,112,142],"are":[3,15],"strongly":[4],"equivalent":[5,16,32,126],"if,":[6],"given":[7],"any":[8],"program":[9],"$P":[10],"\\cup":[11,13],"RQ":[12],"R$":[14],"(that":[17],"is,":[18],"have":[19],"the":[20,29,48,76,106,123,133,169,173,187],"same":[21],"answer":[22,137],"sets).":[23],"Strong":[24],"equivalence":[25,67,91,119,175],"is":[26,44,120],"convenient":[27,121],"for":[28,68,92,122],"study":[30,124],"of":[31,34,59,89,110,117,125,128,136,151,171,176,179,185,189],"transformations":[33,127],"logic":[35,58,69,129],"programs:":[36],"one":[37],"can":[38,61,99,154],"prove":[39],"that":[40,56,97,153,167,184],"a":[41,84,148,164,177,190],"local":[42],"change":[43],"correct":[45],"without":[46,103],"considering":[47],"whole":[49],"program.":[50,193],"Lifschitz,":[51],"Pearce":[52],"Valverde":[54],"showed":[55],"Heyting's":[57],"here-and-there":[60],"be":[62,101,155],"used":[63,156],"to":[64,105,157,183],"characterize":[65],"strong":[66,90,118,161,174],"with":[71,147],"nested":[72],"expressions":[73],"(which":[74],"subsume":[75],"better-known":[77],"extended":[78],"disjunctive":[79],"programs).":[80],"This":[81],"note":[82,145],"considers":[83],"simpler,":[85],"more":[86],"direct":[87],"characterization":[88,116],"such":[93],"programs,":[94],"shows":[96],"it":[98],"also":[100],"applied":[102],"modification":[104],"weight":[107,180,191],"constraint":[108,181,192],"Niemel\u00e4":[111],"Simons.":[113],"Thus,":[114],"this":[115],"written":[131],"in":[132],"input":[134],"languages":[135],"set":[138],"programming":[139],"systems":[140],"dlv":[141],"SMODELS.":[143],"The":[144],"concludes":[146],"brief":[149],"discussion":[150],"results":[152],"automate":[158],"reasoning":[159],"about":[160],"equivalence,":[162],"including":[163],"novel":[165],"encoding":[166],"reduces":[168],"problem":[170],"deciding":[172,186],"pair":[178],"inconsistency":[188]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}