Research Data Repository

Workflow Satisfiability Problem with User-Independent Constraints: Instances, Instance Generator and Algorithms

Karapetyan, Daniel 2019. Workflow Satisfiability Problem with User-Independent Constraints: Instances, Instance Generator and Algorithms. [Dataset]. Colchester, University of Essex. 10.5526/ERDR-00000114

Source code and data for the publication: Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin, Andrei Gagarin. Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. To appear in Journal of Artificial Intelligence Research. Includes: - Source code of an instance generator for the Workflow Satisfiability Problem with User-Independent Constraints (WSP) (part of the C# tool) - Parameters of benchmark instances - Benchmark instances with solutions - Source code of the Pattern Backtracking Algorithm (PBT) (part of the C# tool) - Translator of WSP instances into Pseudo-Boolean formulation (part of the C# tool) - Translator of WSP instances into Constraint Satisfaction Problem formulation (CspRunner.py)

Creators:
Creators NameEmailAffiliationORCID
Karapetyan, Danieldaniel.karapetyan@gmail.comUniversity of Essexhttp://orcid.org/0000-0003-4030-6525
Division: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Keywords: Workflow Satisfiability Problem with User-Independent Constraints, Phase transition, Constraint Satisfaction, Pseudo-Boolean Formulation, Fixed Parameter Tractability, Benchmark instances
Research funder: EPSRC
Grant reference: EP/K005162/1
Grant title: Parameterized Algorithmics for the Analysis and Verification of Constrained Workflow Systems
Depositor: Daniel Karapetyan
Date Deposited: 18 Jul 2019 11:23
Last Modified: 22 Jul 2019 09:32

Available Files

Data

No resources to display

Edit item (login required)

View Item View Item