{"id":"https://openalex.org/W2908288183","doi":null,"title":"Dynamic strategy priority: Empower the strong and abandon the weak","display_name":"Dynamic strategy priority: Empower the strong and abandon the weak","alternate_titles":[],"publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2908288183","mag":"2908288183"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ff5422d0-0684-413f-a170-8b4e38d61e94","doi":null,"is_oa":false,"landing_page_url":"https://www.scopus.com/pages/publications/85052756285","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rawson, M & Reger, G 2018, 'Dynamic strategy priority : Empower the strong and abandon the weak', CEUR Workshop Proceedings, vol. 2162, pp. 58-71.","raw_type":"info:eu-repo/semantics/conferenceObject"},"parent_works":[],"lineage":["https://openalex.org/W2908288183"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5080196917","display_name":"Michael Rawson","orcid":"https://orcid.org/0000-0001-7834-1567","observed_orcids":["https://orcid.org/0000-0001-7834-1567"]},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Michael Rawson","raw_affiliation_strings":["The University of Manchester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Manchester","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052066515","display_name":"Giles Reger","orcid":"https://orcid.org/0000-0001-6353-952X","observed_orcids":["https://orcid.org/0000-0001-6353-952X"]},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Giles Reger","raw_affiliation_strings":["The University of Manchester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Manchester","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":0.7649,"has_fulltext":false,"cited_by_count":7,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.66292542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":"2162","issue":null,"first_page":"58","last_page":"71"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9301999807357788,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9301999807357788,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.04050000011920929,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.004399999976158142,"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/automated-theorem-proving","display_name":"automated theorem proving","score":0.9419999718666077},{"id":"https://openalex.org/keywords/proof-techniques","display_name":"proof techniques","score":0.7940000295639038},{"id":"https://openalex.org/keywords/neural-network","display_name":"artificial neural networks","score":0.6359999775886536},{"id":"https://openalex.org/keywords/strategy-prioritization","display_name":"strategy prioritization","score":0.5210000276565552},{"id":"https://openalex.org/keywords/interactive-theorem-proving","display_name":"interactive theorem proving","score":0.8539999723434448}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5576768517494202}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/ff5422d0-0684-413f-a170-8b4e38d61e94","doi":null,"is_oa":false,"landing_page_url":"https://www.scopus.com/pages/publications/85052756285","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rawson, M & Reger, G 2018, 'Dynamic strategy priority : Empower the strong and abandon the weak', CEUR Workshop Proceedings, vol. 2162, pp. 58-71.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2908288183","doi":null,"is_oa":false,"landing_page_url":"http://ceur-ws.org/Vol-2162/paper-06.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306421305","display_name":"Workshop practical aspects automated reasoning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Workshop practical aspects automated reasoning","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1781094","https://openalex.org/W62264973","https://openalex.org/W836255558","https://openalex.org/W1472528886","https://openalex.org/W1498436455","https://openalex.org/W1500667683","https://openalex.org/W1513576223","https://openalex.org/W1572801864","https://openalex.org/W1573726182","https://openalex.org/W1596717185","https://openalex.org/W1772968073","https://openalex.org/W1780472831","https://openalex.org/W1834745875","https://openalex.org/W2028308254","https://openalex.org/W2101234009","https://openalex.org/W2126869384","https://openalex.org/W2159047538","https://openalex.org/W2159595840","https://openalex.org/W2167964658","https://openalex.org/W2402144811","https://openalex.org/W2574021352","https://openalex.org/W2588018425"],"related_works":["https://openalex.org/W7100908217","https://openalex.org/W4289104048","https://openalex.org/W1600246703","https://openalex.org/W4393027673","https://openalex.org/W7213403648","https://openalex.org/W2013154396","https://openalex.org/W1503260840","https://openalex.org/W2104677739","https://openalex.org/W3202844695","https://openalex.org/W7098494856"],"abstract_inverted_index":{"Automated":[0,46],"theorem":[1,28,47],"provers":[2,43,48],"are":[3,82,88],"often":[4],"used":[5],"in":[6,34,102],"other":[7],"tools":[8],"as":[9,122],"black-boxes":[10],"for":[11,41],"discharging":[12],"proof":[13,53,115],"obligations.":[14],"One":[15],"example":[16],"where":[17],"this":[18],"has":[19],"enjoyed":[20],"a":[21,98,108,123],"lot":[22],"of":[23,52],"success":[24],"is":[25,37,70,76],"within":[26],"interactive":[27],"proving.":[29],"A":[30],"key":[31],"usability":[32,121],"factor":[33],"such":[35],"settings":[36],"the":[38,42,68,103],"time":[39],"taken":[40],"to":[44,60,78,84,112],"complete.":[45],"typically":[49],"run":[50],"lists":[51],"strategies":[54,81],"sequentially,":[55],"which":[56,80,106],"can":[57],"cause":[58],"proofs":[59],"be":[61],"found":[62],"more":[63],"slowly":[64],"than":[65],"necessary":[66],"if":[67],"ordering":[69],"suboptimal.":[71],"We":[72,95],"show":[73],"that":[74],"it":[75],"possible":[77],"predict":[79],"likely":[83],"succeed":[85],"while":[86],"they":[87],"running":[89],"using":[90],"an":[91],"artificial":[92],"neural":[93,110],"network.":[94],"also":[96],"implement":[97],"run-time":[99],"strategy":[100],"scheduler":[101],"Vampire":[104],"prover":[105],"utilises":[107],"trained":[109],"network":[111],"improve":[113],"average":[114],"search":[116],"time,":[117],"and":[118],"hence":[119],"increases":[120],"black-box":[124],"prover.":[125]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2908288183","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2019-01-11T00:00:00"}
