scholarly journals Testing XML constraint satisfiability

2007 ◽  
Vol 174 (6) ◽  
pp. 45-61 ◽  
Author(s):  
Nicole Bidoit ◽  
Dario Colazzo
Keyword(s):  
Constraint Satisfiability

scholarly journals Algorithms for Workflow Satisfiability Problem with User-independent Constraints

2020 ◽  
Vol 1 (1) ◽  
pp. 25-38
Author(s):  
Gregory Gutin
Keyword(s):  
Information Security ◽  
Access Control ◽  
Real World ◽  
Computational Experiments ◽  
Satisfiability Problem ◽  
Iterative Approach ◽  
Constraint Satisfiability ◽  
Fruitful Research

The Workflow Satisfiability Problem (WSP) is a problem of interest in access control of information security. In its simplest form, the problem coincides with the Constraint Satisfiability Problem, where the number of variables is usually much smaller than the number of values. Wang and Li (ACM Trans. Inf. Syst. Secur. 2010) were the first to study the WSP as a problem parameterized by the number of variables. Their paper initiated very fruitful research surveyed by Cohen, Crampton, Gutin and Wahlström (2017). In this paper, we overview more recent WSP algorithmic developments and discuss computational experiments performed on two new testbeds of WSP instances. These WSP instances are closer to real-world ones than those by Karapetyan et al. (JAIR 2019). One of the two testbeds is generated using a novel iterative approach for obtaining computationally hard WSP instances.

Sign in / Sign up

Export Citation Format

Share Document