{"id":"https://openalex.org/W3161976012","doi":"https://doi.org/10.1109/tdsc.2022.3227241","title":"Solving the Workflow Satisfiability Problem Using General Purpose Solvers","display_name":"Solving the Workflow Satisfiability Problem Using General Purpose Solvers","publication_year":2022,"publication_date":"2022-12-07","ids":{"openalex":"https://openalex.org/W3161976012","doi":"https://doi.org/10.1109/tdsc.2022.3227241","mag":"3161976012"},"language":"en","primary_location":{"id":"doi:10.1109/tdsc.2022.3227241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2022.3227241","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","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/A5075467204","display_name":"Daniel Karapetyan","orcid":"https://orcid.org/0000-0003-4030-6525"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Karapetyan","raw_affiliation_strings":["School of Computer Science, University of Nottingham, Nottingham, U.K"],"raw_orcid":"https://orcid.org/0000-0003-4030-6525","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Nottingham, Nottingham, U.K","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044021493","display_name":"Gregory Gutin","orcid":"https://orcid.org/0000-0002-2377-0417"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gregory Gutin","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, University of London, London, U.K"],"raw_orcid":"https://orcid.org/0000-0002-2377-0417","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, University of London, London, U.K","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4162,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66216978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"20","issue":"6","first_page":"4474","last_page":"4485"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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/T10927","display_name":"Access Control and Trust","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9868000149726868,"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/workflow","display_name":"Workflow","score":0.8117265701293945},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6677363514900208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6471371054649353},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.631369948387146},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5105530023574829},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4668147563934326},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4201016426086426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3925821781158447},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3541751801967621},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2985265254974365},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10326352715492249},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07889547944068909}],"concepts":[{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.8117265701293945},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6677363514900208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6471371054649353},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.631369948387146},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5105530023574829},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4668147563934326},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4201016426086426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3925821781158447},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3541751801967621},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2985265254974365},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10326352715492249},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07889547944068909},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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":1,"locations":[{"id":"doi:10.1109/tdsc.2022.3227241","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2022.3227241","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8551038380","display_name":null,"funder_award_id":"RPG-2018-161","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W1185717587","https://openalex.org/W1523795039","https://openalex.org/W1917327560","https://openalex.org/W1964889053","https://openalex.org/W1970736012","https://openalex.org/W1985572324","https://openalex.org/W1989617554","https://openalex.org/W1995725694","https://openalex.org/W2037376972","https://openalex.org/W2038953226","https://openalex.org/W2052773530","https://openalex.org/W2057028717","https://openalex.org/W2064379611","https://openalex.org/W2107311933","https://openalex.org/W2318076643","https://openalex.org/W2410278438","https://openalex.org/W2477784717","https://openalex.org/W2535631240","https://openalex.org/W2665999620","https://openalex.org/W2742476239","https://openalex.org/W2807461721","https://openalex.org/W2914414140","https://openalex.org/W2962695298","https://openalex.org/W2965757790","https://openalex.org/W2971686860","https://openalex.org/W3030262009","https://openalex.org/W3102379243","https://openalex.org/W3161976012","https://openalex.org/W4297791656","https://openalex.org/W4300986476","https://openalex.org/W6631414799","https://openalex.org/W6679472142","https://openalex.org/W6795482257"],"related_works":["https://openalex.org/W2504004674","https://openalex.org/W1981780420","https://openalex.org/W2182707996","https://openalex.org/W45233828","https://openalex.org/W2462424100","https://openalex.org/W2964988449","https://openalex.org/W2963177394","https://openalex.org/W1595229445","https://openalex.org/W2034871982","https://openalex.org/W2397952901"],"abstract_inverted_index":{"The":[0],"workflow":[1,25],"satisfiability":[2],"problem":[3,8],"(WSP)":[4],"is":[5,38,56,85,131],"a":[6,78,111],"well-studied":[7],"in":[9,47,61,68,137],"access":[10],"control":[11],"seeking":[12],"allocation":[13],"of":[14,20,36,45,51,81,107,110,119,128,155,175,198],"authorised":[15],"users":[16,46],"to":[17,24,42,72,77,91,172,193],"every":[18],"step":[19],"the":[21,32,43,48,59,92,105,116,120,126,141],"workflow,":[22],"subject":[23],"specification":[26],"constraints.":[27],"It":[28],"was":[29,70],"noticed":[30],"that":[31,150,186],"number":[33,44,127],"<inline-formula><tex-math":[34,54],"notation=\"LaTeX\">$k$</tex-math></inline-formula>":[35,55],"steps":[37],"typically":[39],"small":[40,124],"compared":[41],"real-world":[49],"instances":[50],"WSP;":[52],"therefore":[53],"considered":[57],"as":[58,115],"parameter":[60],"WSP":[62,67,75,133,160,177],"parametrised":[63],"complexity":[64],"research.":[65],"While":[66,179],"general":[69],"shown":[71],"be":[73,96,135],"W[1]-hard,":[74],"restricted":[76],"special":[79],"case":[80],"user-independent":[82],"(UI)":[83],"constraints":[84,94,121,130,163],"fixed-parameter":[86],"tractable":[87],"(FPT).":[88],"However,":[89],"restriction":[90],"UI":[93],"might":[95],"impractical.":[97],"To":[98],"efficiently":[99],"handle":[100],"non-UI":[101,129],"constraints,":[102],"we":[103,148,184],"introduce":[104],"notion":[106],"branching":[108,117],"factor":[109],"constraint.":[112],"As":[113],"long":[114],"factors":[118],"are":[122,153],"relatively":[123],"and":[125],"reasonable,":[132],"can":[134],"solved":[136],"FPT":[138,200],"time.":[139],"Extending":[140],"results":[142],"from":[143],"Karapetyan":[144],"et":[145],"al.":[146],"(2019),":[147],"demonstrate":[149],"general-purpose":[151],"solvers":[152],"capable":[154],"achieving":[156],"FPT-like":[157],"performance":[158],"on":[159,181],"with":[161,166],"arbitrary":[162],"when":[164],"used":[165],"appropriate":[167],"formulations.":[168],"This":[169],"enables":[170],"one":[171],"tackle":[173],"most":[174],"practical":[176],"instances.":[178],"important":[180],"its":[182],"own,":[183],"hope":[185],"this":[187],"result":[188],"will":[189],"also":[190],"motivate":[191],"researchers":[192],"look":[194],"for":[195],"FPT-aware":[196],"formulations":[197],"other":[199],"problems.":[201]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}