Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints

DOI10.1007/978-3-319-19647-3_13zbMath1407.68227arXiv1412.7834OpenAlexW1185717587MaRDI QIDQ3452559

Daniel Karapetyan, Gregory Gutin, Andrei Gagarin

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.7834

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints, 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

Uses Software

• Sat4j

Cites Work

• Unnamed Item
• Algorithms for the workflow satisfiability problem engineered for counting constraints
• Fundamentals of parameterized complexity
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
• Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints