Matches in SemOpenAlex for { <https://semopenalex.org/work/W3030262009> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W3030262009 abstract "There has been a considerable interest in recent years in the problem of workflow satisfiability which seeks an allocation of authorised users to every step of the workflow, subject to workflow specification constraints. Unfortunately, the workflow satisfiability problem (WSP) where arbitrary constraints are allowed, is computationally intractable. Wang and Li (2010) were the first to study WSP in the framework of parameterized complexity (with the parameter being the number of steps). Wang and Li proved that the WSP for arbitrary constraints is intractable even in the framework of parameterized complexity, i.e., it is highly unlikely to be fixed-parameter tractable (FPT). Extending the work of Wang and Li (2013) and Crampton et al. (2013), Cohen et al. (2014) introduced the family of user-independent (UI) constraints, which are constraints whose satisfiability does not depend on the identities of the users. Cohen et al. proved that WSP with UI constraints is FPT. Karapetyan et al. (2019) employed these ideas in practically efficient solution methods for WSP with UI constraints, including methods based on SAT and CSP general purpose solvers. While the family of UI constraints includes the most common constraints used in practice, some real-world cases are outside of the family. In this paper, we generalise the concept of authorizations by making them context-dependent and show how to absorb some non-UI constraints into context-dependent authorizations. This allows us to extend algorithms and their implementations developed for WSP with UI constraints to arbitrary constraints. We carry out computational experiments with a general-purpose SAT solver, SAT4J, to test practicality of solving WSP with UI and non-UI constraints using our approach." @default.
- W3030262009 created "2020-06-05" @default.
- W3030262009 creator A5044021493 @default.
- W3030262009 creator A5075467204 @default.
- W3030262009 date "2020-06-10" @default.
- W3030262009 modified "2023-09-25" @default.
- W3030262009 title "Constraint Branching in Workflow Satisfiability Problem" @default.
- W3030262009 cites W1185717587 @default.
- W3030262009 cites W1917327560 @default.
- W3030262009 cites W1964889053 @default.
- W3030262009 cites W1970736012 @default.
- W3030262009 cites W1985572324 @default.
- W3030262009 cites W1989617554 @default.
- W3030262009 cites W1995725694 @default.
- W3030262009 cites W2037376972 @default.
- W3030262009 cites W2038953226 @default.
- W3030262009 cites W2052773530 @default.
- W3030262009 cites W2057028717 @default.
- W3030262009 cites W2064379611 @default.
- W3030262009 cites W2410278438 @default.
- W3030262009 cites W2535631240 @default.
- W3030262009 cites W2807461721 @default.
- W3030262009 cites W2962695298 @default.
- W3030262009 cites W2965757790 @default.
- W3030262009 cites W5815757 @default.
- W3030262009 doi "https://doi.org/10.1145/3381991.3395600" @default.
- W3030262009 hasPublicationYear "2020" @default.
- W3030262009 type Work @default.
- W3030262009 sameAs 3030262009 @default.
- W3030262009 citedByCount "4" @default.
- W3030262009 countsByYear W30302620092021 @default.
- W3030262009 countsByYear W30302620092022 @default.
- W3030262009 crossrefType "proceedings-article" @default.
- W3030262009 hasAuthorship W3030262009A5044021493 @default.
- W3030262009 hasAuthorship W3030262009A5075467204 @default.
- W3030262009 hasConcept C11413529 @default.
- W3030262009 hasConcept C159985019 @default.
- W3030262009 hasConcept C168773769 @default.
- W3030262009 hasConcept C177212765 @default.
- W3030262009 hasConcept C192562407 @default.
- W3030262009 hasConcept C199360897 @default.
- W3030262009 hasConcept C206175624 @default.
- W3030262009 hasConcept C2524010 @default.
- W3030262009 hasConcept C2776036281 @default.
- W3030262009 hasConcept C33923547 @default.
- W3030262009 hasConcept C41008148 @default.
- W3030262009 hasConcept C6943359 @default.
- W3030262009 hasConcept C77088390 @default.
- W3030262009 hasConcept C80444323 @default.
- W3030262009 hasConceptScore W3030262009C11413529 @default.
- W3030262009 hasConceptScore W3030262009C159985019 @default.
- W3030262009 hasConceptScore W3030262009C168773769 @default.
- W3030262009 hasConceptScore W3030262009C177212765 @default.
- W3030262009 hasConceptScore W3030262009C192562407 @default.
- W3030262009 hasConceptScore W3030262009C199360897 @default.
- W3030262009 hasConceptScore W3030262009C206175624 @default.
- W3030262009 hasConceptScore W3030262009C2524010 @default.
- W3030262009 hasConceptScore W3030262009C2776036281 @default.
- W3030262009 hasConceptScore W3030262009C33923547 @default.
- W3030262009 hasConceptScore W3030262009C41008148 @default.
- W3030262009 hasConceptScore W3030262009C6943359 @default.
- W3030262009 hasConceptScore W3030262009C77088390 @default.
- W3030262009 hasConceptScore W3030262009C80444323 @default.
- W3030262009 hasLocation W30302620091 @default.
- W3030262009 hasOpenAccess W3030262009 @default.
- W3030262009 hasPrimaryLocation W30302620091 @default.
- W3030262009 hasRelatedWork W1567492448 @default.
- W3030262009 hasRelatedWork W2090854154 @default.
- W3030262009 hasRelatedWork W2141692543 @default.
- W3030262009 hasRelatedWork W2172820611 @default.
- W3030262009 hasRelatedWork W2404089326 @default.
- W3030262009 hasRelatedWork W2404668260 @default.
- W3030262009 hasRelatedWork W2739847400 @default.
- W3030262009 hasRelatedWork W2776836749 @default.
- W3030262009 hasRelatedWork W2896904638 @default.
- W3030262009 hasRelatedWork W3213667392 @default.
- W3030262009 isParatext "false" @default.
- W3030262009 isRetracted "false" @default.
- W3030262009 magId "3030262009" @default.
- W3030262009 workType "article" @default.