Iterative Plan Construction for the Workflow Satisfiability Problem
From MaRDI portal
Publication:2938473
DOI10.1613/jair.4435zbMath1315.68145arXiv1306.3649OpenAlexW3102379243MaRDI QIDQ2938473
No author found.
Publication date: 14 January 2015
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3649
Analysis of algorithms and problem complexity (68Q25) Theory of organizations, manpower planning in operations research (90B70)
Related Items (6)
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints ⋮ Polynomial kernels and user reductions for the workflow satisfiability problem ⋮ Algorithms for the workflow satisfiability problem engineered for counting constraints ⋮ Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis ⋮ On the satisfiability of authorization requirements in business process ⋮ Parameterized Complexity of the Workflow Satisfiability Problem
This page was built for publication: Iterative Plan Construction for the Workflow Satisfiability Problem
