[1] |
WANG Q , LI N . Satisfiability and resiliency in workflow authorization systems[J]. ACM Transactions on Information and System Security, 2010,13(4): 747-759.
|
[2] |
翟治年, 王刚, 郑志军 ,等. 基于可满足性计数的(≠,=)约束工作流顽健性验证[J]. 电子学报, 2015,43(11):2298-2234. ZHAI Z N , WANG G , ZHENG Z J , et al. Verification of(≠,=) constrained workflow robustness based on satisfiability counting[J]. Acta Electronica, 2015,43(11):2298-2234.
|
[3] |
AHMED T , TRIPATHI A R . Security policies in distributed CSCW and workflow systems[J]. IEEE Transactions on Systems, Man,and Cybernetics Part A:Systems and Humans, 2010,40(6): 1220-1231.
|
[4] |
BERTINO E , FERRARI E , ALTURI V . The specification and enforcement of authorization constraints in workflow management systems[J]. ACM Transactions on Information System Security, 1999,2(1): 65-104.
|
[5] |
CRAMPTON J , KHAMBHAMMETTU H . Delegation and satisfiability in workflow systems[C]// 13th ACM Symposium on Access Control Models and Technologies, June 11,2008, Colorado, USA, New York:ACM Press, 2008: 31-40.
|
[6] |
BASIN D , BURRI S J , KARJOTH G . Obstruction-free authorization enforcement: aligning security and business objectives[C]// The 24th ComputerSecurityFoundationsSymposium, June 27,2011, Cernay, France. New Jersey:IEEE Press, 2011: 99-113.
|
[7] |
CRAMPTON J , GUTIN G , YEO A . On the parameterized complexi and Kernelization of the workflow satisfiability problem[J]. AC Transactions on Information and System Security, 2012,16(1): 1518-1527.
|
[8] |
翟治年, 卢亚辉, 周武杰 , 等. 工作流可满足性(≠)计数的固定参数线性算法[J]. 计算机学报, 2016(39). ZHAI Z N , LU Y H , ZHOU W J , et al. Fixed-parameter linear algorithm for counting workflow satisfiability (≠)[J]. Chinese Journal of Computers, 2016(39).
|
[9] |
JEGOU P , TERRIOUX C . Hybrid backtracking bounded by tree-decomposition of constraint networks[J]. Artificial Intelligence, 2003,146(1): 43-75.
|
[10] |
ROBERTSON N , SEYMOUR P D , GRAPH MINORS . II. Algorithmic aspects of tree-width[J]. Journal of Algorithms, 1986,7(86): 309-322.
|
[11] |
DECHTER R , PEARL J . Tree clustering for constraint networks[J]. Artificial Intelligence, 1989,38(4): 353-366.
|
[12] |
BULATOV A A . The complexity of the counting constraint satisfaction problem[J]. Physical Review D Particles & Fields, 1993,49(10): 5349-5363.
|
[13] |
谷文祥, 朱磊, 黄平 , 等. 可满足问题中的模型计数[J]. 智能系统学报, 2012,7(1):33-39. GU W X , ZHU L , HUANG P , et al. The model counting of a satisfiability problem[J]. CAAI Transactions on Intelligent Systems, 2012,7(1):33-39.
|
[14] |
ANGEL SMARK O , JONSSON P , LINUSSON S , et al. Determining the number of solutions to binary CSP instances[C]// 8th International Conference on Principles and Practice of Constraint Programming, September 9,2002, New York, USA. New Jersey:IEEE Press, 2002: 181-186.
|
[15] |
ANGELSMARK O , JONSSON P . Improved algorithms for counting solutions in constraint satisfaction problems[J]. Lecture Notes in Computer Science, 2003(2833): 81-95.
|
[16] |
DAHLL?F V , JONSSON P , WAHLSTR?M M . Counting models for 2SAT and 3SAT formulae[J]. Theoretical Computer Science, 2005,332(1-3): 265-291.
|
[17] |
MARCIAL-ROMERO J R , LUNA G D I , HERNáNDEZ J A , et al. A parametric polynomial deterministic algorithm for #2SAT[M]. Advances in Artificial Intelligence and Soft Computing. New York:Springer International Publishing, 2015.
|
[18] |
FAVIER A , GIVRY S D , JéGOU P . Exploiting problem structure for solution counting[C]// International Conference on Principles and Practice of Constraint Programming, September 20,2009, Lisbon, Portugal. New Jersey:IEEE Press, 2009: 335-343.
|