Algorithms for the workflow satisfiability problem engineered for counting constraints

DOI10.1007/s10878-015-9877-7zbMath1354.90105arXiv1504.02420OpenAlexW2037376972MaRDI QIDQ328681

Mohammad Hasan, M. Dambrine

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

algorithm engineeringfixed-parameter tractability (FPT)reduction to the pseudo-Boolean SAT problemuser-independent constraintsworkflow satisfiability problem (WSP)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

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

Uses Software

• SPOT
• Sat4j

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Errors in graph embedding algorithms
• Parametrized complexity theory.
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Algorithm Engineering: Concepts and Practice
• Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
• Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints

This page was built for publication: Algorithms for the workflow satisfiability problem engineered for counting constraints