{"id":"https://openalex.org/W3030262009","doi":"https://doi.org/10.1145/3381991.3395600","title":"Constraint Branching in Workflow Satisfiability Problem","display_name":"Constraint Branching in Workflow Satisfiability Problem","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3030262009","doi":"https://doi.org/10.1145/3381991.3395600","mag":"3030262009"},"language":"en","primary_location":{"id":"doi:10.1145/3381991.3395600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3381991.3395600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM Symposium on Access Control Models and Technologies","raw_type":"proceedings-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/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":["Royal Holloway, University of London, Egham , United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham , United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","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":["University of Nottingham, Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1019,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85248433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"9636","issue":null,"first_page":"93","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9980000257492065,"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/T10237","display_name":"Cryptography and Data Security","score":0.995199978351593,"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8409998416900635},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7336859703063965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7255314588546753},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.6948381662368774},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5385843515396118},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5361900329589844},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48361292481422424},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4833223819732666},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4486871659755707},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.43887773156166077},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.349838525056839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33048999309539795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2850680947303772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24828261137008667},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11049294471740723},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0990954041481018}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8409998416900635},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7336859703063965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7255314588546753},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6948381662368774},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5385843515396118},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5361900329589844},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48361292481422424},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4833223819732666},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4486871659755707},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.43887773156166077},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.349838525056839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33048999309539795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2850680947303772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24828261137008667},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11049294471740723},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0990954041481018},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3381991.3395600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3381991.3395600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM Symposium on Access Control Models and Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W1185717587","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/W2007774531","https://openalex.org/W2037376972","https://openalex.org/W2038953226","https://openalex.org/W2052773530","https://openalex.org/W2057028717","https://openalex.org/W2064379611","https://openalex.org/W2342003585","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/W3102379243","https://openalex.org/W4300986476"],"related_works":["https://openalex.org/W1865369187","https://openalex.org/W2997249752","https://openalex.org/W4303044088","https://openalex.org/W2523981875","https://openalex.org/W2102858635","https://openalex.org/W2097415053","https://openalex.org/W2322595442","https://openalex.org/W1486916474","https://openalex.org/W4245692971","https://openalex.org/W3124056051"],"abstract_inverted_index":{"There":[0],"has":[1],"been":[2],"a":[3,246],"considerable":[4],"interest":[5],"in":[6,9,57,84,156,188],"recent":[7],"years":[8],"the":[10,26,34,52,58,64,67,76,85,101,118,133,136,177,183,196,203],"problem":[11,37],"of":[12,19,25,60,69,87,103,120,135,179,195,205,254],"workflow":[13,30,35],"satisfiability":[14,36,128],"which":[15,124],"seeks":[16],"an":[17],"allocation":[18],"authorised":[20],"users":[21],"to":[22,29,54,95,214,225,237,251],"every":[23],"step":[24],"workflow,":[27],"subject":[28],"specification":[31],"constraints.":[32,239],"Unfortunately,":[33],"(WSP)":[38],"where":[39],"arbitrary":[40,79,238],"constraints":[41,80,126,146,181,186,218,236,261],"are":[42,125,193],"allowed,":[43],"is":[44,81,92,147],"computationally":[45],"intractable.":[46],"Wang":[47,71,104],"and":[48,72,105,108,171,211,228,259],"Li":[49,73,106],"(2010)":[50],"were":[51],"first":[53],"study":[55],"WSP":[56,77,143,162,233,256],"framework":[59,86],"parameterized":[61,88],"complexity":[62],"(with":[63],"parameter":[65],"being":[66],"number":[68],"steps).":[70],"proved":[74,141],"that":[75,142],"for":[78,161,232],"intractable":[82],"even":[83],"complexity,":[89],"i.e.,":[90],"it":[91],"highly":[93],"unlikely":[94],"be":[96],"fixed-parameter":[97],"tractable":[98],"(FPT).":[99],"Extending":[100],"work":[102],"(2013)":[107],"Crampton":[109],"et":[110,114,139,150],"al.":[111,115,140,151],"(2013),":[112],"Cohen":[113,138],"(2014)":[116],"introduced":[117],"family":[119,178],"user-independent":[121],"(UI)":[122],"constraints,":[123,165],"whose":[127],"does":[129],"not":[130],"depend":[131],"on":[132,169],"identities":[134],"users.":[137],"with":[144,163,234,245,257],"UI":[145,164,180,235,258],"FPT.":[148],"Karapetyan":[149],"(2019)":[152],"employed":[153],"these":[154],"ideas":[155],"practically":[157],"efficient":[158],"solution":[159],"methods":[160,167],"including":[166],"based":[168],"SAT":[170,248],"CSP":[172],"general":[173],"purpose":[174],"solvers.":[175],"While":[176],"includes":[182],"most":[184],"common":[185],"used":[187],"practice,":[189],"some":[190,216],"real-world":[191],"cases":[192],"outside":[194],"family.":[197],"In":[198],"this":[199],"paper,":[200],"we":[201],"generalise":[202],"concept":[204],"authorizations":[206],"by":[207],"making":[208],"them":[209],"context-dependent":[210,220],"show":[212],"how":[213],"absorb":[215],"non-UI":[217,260],"into":[219],"authorizations.":[221],"This":[222],"allows":[223],"us":[224],"extend":[226],"algorithms":[227],"their":[229],"implementations":[230],"developed":[231],"We":[240],"carry":[241],"out":[242],"computational":[243],"experiments":[244],"general-purpose":[247],"solver,":[249],"SAT4J,":[250],"test":[252],"practicality":[253],"solving":[255],"using":[262],"our":[263],"approach.":[264]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}