Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
- Submitting institution
-
University of Nottingham, The
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2596261
- Type
- D - Journal article
- DOI
-
10.1613/jair.1.11339
- Title of journal
- Journal of Artificial Intelligence Research
- Article number
- -
- First page
- 85
- Volume
- 66
- Issue
- -
- ISSN
- 1076-9757
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper provides a new approach to an important information security problem. The approach dramatically extends the range of practically-solvable instances, demonstrating that fixed parameter tractability (FPT) is of practical importance when merged with AI techniques; and that FPT results can guide problem reformulations, giving off-the-shelf solvers performances comparable to bespoke algorithms. Novel and rigorous empirical studies of scaling properties of FPT algorithms account for the essential well-known interactions between phase transitions and computational difficulty. This study has influenced other research and attracted significant attention from practitioners during a keynote talk at IEEE Transdisciplinary AI 2019.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
