Engineering algorithms for workflow satisfiability problem with user-independent constraints

DOI10.1007/978-3-319-08016-1_5MaRDI QIDQ3188832zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2014

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

Full work available at URL http://orca.cf.ac.uk/91298/1/faw_46.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Algorithms for the workflow satisfiability problem engineered for counting constraints
• Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
• Iterative Plan Construction for the Workflow Satisfiability Problem
• On the workflow satisfiability problem with class-independent constraints
• Pattern-based approach to the workflow satisfiability problem with user-independent constraints

Cited in

(9)

• On the satisfiability of authorization requirements in business process
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Polynomial kernels and user reductions for the workflow satisfiability problem
• Algorithms for the workflow satisfiability problem engineered for counting constraints
• Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
• Parameterized complexity of the workflow satisfiability problem
• Pattern-based approach to the workflow satisfiability problem with user-independent constraints
• On the workflow satisfiability problem with class-independent constraints
• Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis

This page was built for publication: Engineering algorithms for workflow satisfiability problem with user-independent constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188832)