Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

DOI10.1007/978-3-319-08016-1_5zbMath1407.68448OpenAlexW121530805MaRDI QIDQ3188832

No author found.

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)

Related Items (5)

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 ⋮ On the satisfiability of authorization requirements in business process ⋮ Parameterized Complexity of the Workflow Satisfiability Problem

This page was built for publication: Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints