Role mining using answer set programming

With the increasing adoption of role-based access control (RBAC) in business security, role mining technology has been widely applied to aid the process of migrating a non-RBAC system to an RBAC system. However, because it is hard to deal with a variety of constraint conflicts at the same time, none...

Full description

Saved in:
Bibliographic Details
Published in:Future generation computer systems Vol. 55; pp. 336 - 343
Main Authors: Ye, Wei, Li, Ruixuan, Gu, Xiwu, Li, Yuhua, Wen, Kunmei
Format: Journal Article
Language:English
Published: Elsevier B.V 01.02.2016
Subjects:
ISSN:0167-739X, 1872-7115
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract With the increasing adoption of role-based access control (RBAC) in business security, role mining technology has been widely applied to aid the process of migrating a non-RBAC system to an RBAC system. However, because it is hard to deal with a variety of constraint conflicts at the same time, none of existing role mining algorithms can simultaneously satisfy various constraints that usually describe organizations’ security and business requirements. To extend the ability of role mining technology, this paper proposes a novel role mining approach using answer set programming (ASP) that complies with constraints and meets various optimization objectives, named constrained role miner (CRM). Essentially, the idea is that ASP is an approach to declarative problem solving. Thus, either to discover RBAC configurations or to deal with conflicts between constraints, ASP programs do not need to specify how answers are computed. Finally, we demonstrate the effectiveness and efficiency of our approach through experimental results. •We propose a novel role mining approach using ASP.•This novel role mining approach can comply with various kinds of constraints.•This novel role mining approach meets multi-objective optimization at the same time.
AbstractList With the increasing adoption of role-based access control (RBAC) in business security, role mining technology has been widely applied to aid the process of migrating a non-RBAC system to an RBAC system. However, because it is hard to deal with a variety of constraint conflicts at the same time, none of existing role mining algorithms can simultaneously satisfy various constraints that usually describe organizations’ security and business requirements. To extend the ability of role mining technology, this paper proposes a novel role mining approach using answer set programming (ASP) that complies with constraints and meets various optimization objectives, named constrained role miner (CRM). Essentially, the idea is that ASP is an approach to declarative problem solving. Thus, either to discover RBAC configurations or to deal with conflicts between constraints, ASP programs do not need to specify how answers are computed. Finally, we demonstrate the effectiveness and efficiency of our approach through experimental results. •We propose a novel role mining approach using ASP.•This novel role mining approach can comply with various kinds of constraints.•This novel role mining approach meets multi-objective optimization at the same time.
Author Li, Yuhua
Ye, Wei
Wen, Kunmei
Li, Ruixuan
Gu, Xiwu
Author_xml – sequence: 1
  givenname: Wei
  surname: Ye
  fullname: Ye, Wei
  email: csio@hust.edu.cn
– sequence: 2
  givenname: Ruixuan
  surname: Li
  fullname: Li, Ruixuan
  email: rxli@hust.edu.cn
– sequence: 3
  givenname: Xiwu
  surname: Gu
  fullname: Gu, Xiwu
  email: guxiwu@hust.edu.cn
– sequence: 4
  givenname: Yuhua
  surname: Li
  fullname: Li, Yuhua
  email: idcliyuhua@hust.edu.cn
– sequence: 5
  givenname: Kunmei
  surname: Wen
  fullname: Wen, Kunmei
  email: kmwen@hust.edu.cn
BookMark eNqFj01LAzEQhoNUcFv9Bx726GXXZL-y60GQYlUoCKLgLSSTSUnpZkuSKv57d6knD3qZgXfmeeGZk5kbHBJyyWjOKGuut7k5xIPHvKCsGqOcsvaEJKzlRcYZq2ckGd94xsvu_YzMQ9hSShkvWUKuXoYdpr111m3SQ5imdOETfRowpns_bLzsx_PmnJwauQt48bMX5G11_7p8zNbPD0_Lu3UGJW9ipqAEIytVgpYUuoZ1muu25axSpqBYc6WNVm1T1QoM1l3dSNRF0UGhAKGGckGqYy_4IQSPRuy97aX_EoyKyVZsxdFWTLZTOtqO2M0vDGyU0Q4ueml3_8G3RxhHsQ-LXgSw6AC19QhR6MH-XfANFi524Q
CitedBy_id crossref_primary_10_1016_j_ins_2019_04_050
crossref_primary_10_1016_j_cose_2023_103100
crossref_primary_10_1016_j_future_2017_07_035
crossref_primary_10_3390_math11143047
crossref_primary_10_1016_j_future_2015_11_008
crossref_primary_10_3390_fi11090201
crossref_primary_10_1016_j_comcom_2020_12_006
Cites_doi 10.1145/1133058.1133077
10.1145/1266840.1266862
10.1145/2043174.2043195
10.1145/501978.501980
10.1145/1377836.1377838
10.1109/2.485845
10.1109/ACSAC.2008.38
10.1145/1180405.1180424
10.1145/507711.507718
10.1145/1266840.1266870
10.1145/1880022.1880030
10.1145/382912.382913
10.1145/2414456.2414499
10.1109/ACSAC.2001.991529
10.1145/1063979.1064008
10.1145/1030083.1030091
10.1109/TDSC.2010.55
10.1145/270152.270159
10.1145/775433.775435
10.1145/775412.775419
10.1007/978-3-642-17714-9_13
10.1145/1542207.1542224
ContentType Journal Article
Copyright 2014 Elsevier B.V.
Copyright_xml – notice: 2014 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.future.2014.10.018
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7115
EndPage 343
ExternalDocumentID 10_1016_j_future_2014_10_018
S0167739X14002118
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29H
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABJNI
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
UHS
WUQ
XPP
ZMT
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ADNMO
AEIPS
AFJKZ
AGQPQ
AIIUN
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c376t-bc3cfa4b3cda0c9619d7d88714bf20e57bdfdb8645bcfe5956aed229c2bcec5c3
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000368652400028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-739X
IngestDate Tue Nov 18 21:51:05 EST 2025
Sat Nov 29 07:57:20 EST 2025
Fri Feb 23 02:30:18 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Role mining
RBAC
Constraint
Answer set programming
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c376t-bc3cfa4b3cda0c9619d7d88714bf20e57bdfdb8645bcfe5956aed229c2bcec5c3
PageCount 8
ParticipantIDs crossref_primary_10_1016_j_future_2014_10_018
crossref_citationtrail_10_1016_j_future_2014_10_018
elsevier_sciencedirect_doi_10_1016_j_future_2014_10_018
PublicationCentury 2000
PublicationDate 2016-02-01
PublicationDateYYYYMMDD 2016-02-01
PublicationDate_xml – month: 02
  year: 2016
  text: 2016-02-01
  day: 01
PublicationDecade 2010
PublicationTitle Future generation computer systems
PublicationYear 2016
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References J. Crampton, Specifying and enforcing constraints in role-based access control, in: ACM Symposium on Access Control Models and Technologies, pp. 43–50, 2003.
Sun, Wang, Li, Bertino, Atallah (br000070) 2011; 8
Brewka, Eiter, Truszczynski (br000075) 2011; 54
D. Zhang, K. Ramamohanarao, T. Ebringer, Role engineering using graph optimisation, in: Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, pp. 139–144, 2007.
J. Schlegelmilch, U. Steffens, Role mining with ORCA, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 168–176, 2005.
A. Ene, W. Horne, N. Milosavljevic, P. Rao, R. Schreiber, R.E. Tarjan, Fast exact and heuristic methods for role minimization problems, in: Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, pp. 1–10, 2008.
Ferraiolo, Sandhu, Gavrila, Kuhn, Chandramouli (br000010) 2001; 4
Sandhu, Coyne, Feinstein, Youman (br000005) 1996; 29
R. Kumar, S. Sural, A. Gupta, Mining rbac roles under cardinality constraint, in: Proceedings of the 6th international conference on Information systems security (ICISS10), pp. 171-185, 2010.
M. Kuhlmann, D. Shohat, G. Schimpf, Role mining–revealing business roles for security administration using data mining technology, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 179–186, 2003.
J. Vaidya, V. Atluri, J. Warner, RoleMiner: mining roles using subset enumeration, in: Proc. ACM Conference on Computer and Communications Security (CCS), pp. 144–153, 2006.
P. Epstein, R. Sandhu, Engineering of role/permission assignments, in: Annual Computer Security Applications Conference (ACSAC), pp. 127–36, 2001.
A. Kern, M. Kuhlmann, A. Schaad, J. Moffett, Observations on the role life-cycle in the context of enterprise security management, in: Proceedings of the seventh ACM symposium on Access control models and technologies, pp. 43–51, 2002.
Molloy, Chen, Li, Wang, Li, Bertino, Calo, Lobo (br000050) 2010; 13
N. Li, Z. Bizri, M.V. Tripunitara, On mutually-exclusive roles and separation of duty, in: ACM Conference on Computer and Communications Security, pp. 42–51, 2004.
J. Vaidya, V. Atluri, Q. Guo, The role mining problem:finding a minimal descriptive set of roles, in: Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, pp. 175–184, 2007.
J. Hu, K. Khaled, Y. Bai, Y. Zhang, Constraint-enhanced role engineering via answer set programming, in: Proceedings of 7th ACM Symposium on Information, Computer and Communications Security, pp. 73–74, 2012.
I. Molloy, N. Li, T. Li, Z. Mao, Q. Wang, J. Lobo, Evaluating role mining algorithms, in: Proceedings of the 14th ACM Symposium on Access Control Models and Technologies, pp. 95–104, 2009.
H. Chen, N. Li, Constraint Generation for Separation of Duty, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 130–138, 2006.
Ahn, Sandhu (br000055) 2000; 3
E.J. Coyne, Role engineering, in: Proc. ACM Workshop on Role-Based Access Control (RBAC), 1995.
Q. Guo, J. Vaidya, V. Atluri, The role hierarchy mining problem: Discovery of optimal role hierarchies, in: Annual Computer Security Applications Conference (ACSAC), pp. 237–246, 2008.
Lu, Vaidya, Atluri, Hong (br000105) 2012; 9
M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, A User’s Guide to gringo, clasp, clingo, and iclingo.
10.1016/j.future.2014.10.018_br000115
10.1016/j.future.2014.10.018_br000025
Ferraiolo (10.1016/j.future.2014.10.018_br000010) 2001; 4
10.1016/j.future.2014.10.018_br000015
10.1016/j.future.2014.10.018_br000030
10.1016/j.future.2014.10.018_br000085
10.1016/j.future.2014.10.018_br000020
Brewka (10.1016/j.future.2014.10.018_br000075) 2011; 54
10.1016/j.future.2014.10.018_br000040
10.1016/j.future.2014.10.018_br000095
10.1016/j.future.2014.10.018_br000045
10.1016/j.future.2014.10.018_br000100
10.1016/j.future.2014.10.018_br000035
10.1016/j.future.2014.10.018_br000065
10.1016/j.future.2014.10.018_br000120
10.1016/j.future.2014.10.018_br000110
Ahn (10.1016/j.future.2014.10.018_br000055) 2000; 3
10.1016/j.future.2014.10.018_br000060
Sun (10.1016/j.future.2014.10.018_br000070) 2011; 8
10.1016/j.future.2014.10.018_br000090
10.1016/j.future.2014.10.018_br000080
Sandhu (10.1016/j.future.2014.10.018_br000005) 1996; 29
Lu (10.1016/j.future.2014.10.018_br000105) 2012; 9
Molloy (10.1016/j.future.2014.10.018_br000050) 2010; 13
References_xml – reference: J. Vaidya, V. Atluri, J. Warner, RoleMiner: mining roles using subset enumeration, in: Proc. ACM Conference on Computer and Communications Security (CCS), pp. 144–153, 2006.
– reference: H. Chen, N. Li, Constraint Generation for Separation of Duty, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 130–138, 2006.
– volume: 9
  start-page: 655
  year: 2012
  end-page: 669
  ident: br000105
  article-title: Constraint-aware role mining via extended boolean matrix decomposition
  publication-title: IEEE Trans. Dependable Secure Comput.
– reference: J. Schlegelmilch, U. Steffens, Role mining with ORCA, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 168–176, 2005.
– reference: R. Kumar, S. Sural, A. Gupta, Mining rbac roles under cardinality constraint, in: Proceedings of the 6th international conference on Information systems security (ICISS10), pp. 171-185, 2010.
– reference: I. Molloy, N. Li, T. Li, Z. Mao, Q. Wang, J. Lobo, Evaluating role mining algorithms, in: Proceedings of the 14th ACM Symposium on Access Control Models and Technologies, pp. 95–104, 2009.
– reference: A. Ene, W. Horne, N. Milosavljevic, P. Rao, R. Schreiber, R.E. Tarjan, Fast exact and heuristic methods for role minimization problems, in: Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, pp. 1–10, 2008.
– reference: M. Kuhlmann, D. Shohat, G. Schimpf, Role mining–revealing business roles for security administration using data mining technology, in: Proc. ACM Symposium on Access Control Models and Technologies (SACMAT), pp. 179–186, 2003.
– reference: J. Crampton, Specifying and enforcing constraints in role-based access control, in: ACM Symposium on Access Control Models and Technologies, pp. 43–50, 2003.
– volume: 3
  start-page: 207
  year: 2000
  end-page: 226
  ident: br000055
  article-title: Role-based authorization constraints specification
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
– volume: 54
  start-page: 92
  year: 2011
  end-page: 103
  ident: br000075
  article-title: Answer set programming at a glance
  publication-title: Commun. ACM
– volume: 4
  start-page: 224
  year: 2001
  end-page: 274
  ident: br000010
  article-title: Proposed NIST standard for role-based access control
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
– reference: D. Zhang, K. Ramamohanarao, T. Ebringer, Role engineering using graph optimisation, in: Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, pp. 139–144, 2007.
– volume: 29
  start-page: 38
  year: 1996
  end-page: 47
  ident: br000005
  article-title: Role-based access control models
  publication-title: IEEE Computer
– reference: N. Li, Z. Bizri, M.V. Tripunitara, On mutually-exclusive roles and separation of duty, in: ACM Conference on Computer and Communications Security, pp. 42–51, 2004.
– reference: P. Epstein, R. Sandhu, Engineering of role/permission assignments, in: Annual Computer Security Applications Conference (ACSAC), pp. 127–36, 2001.
– volume: 13
  start-page: 36
  year: 2010
  ident: br000050
  article-title: Mining roles with multiple objectives
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
– reference: J. Hu, K. Khaled, Y. Bai, Y. Zhang, Constraint-enhanced role engineering via answer set programming, in: Proceedings of 7th ACM Symposium on Information, Computer and Communications Security, pp. 73–74, 2012.
– reference: M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, A User’s Guide to gringo, clasp, clingo, and iclingo.
– reference: E.J. Coyne, Role engineering, in: Proc. ACM Workshop on Role-Based Access Control (RBAC), 1995.
– reference: A. Kern, M. Kuhlmann, A. Schaad, J. Moffett, Observations on the role life-cycle in the context of enterprise security management, in: Proceedings of the seventh ACM symposium on Access control models and technologies, pp. 43–51, 2002.
– volume: 8
  start-page: 883
  year: 2011
  end-page: 897
  ident: br000070
  article-title: On the complexity of authorization in rbac under qualification and security constraints
  publication-title: IEEE Trans. Dependable Secure Comput.
– reference: J. Vaidya, V. Atluri, Q. Guo, The role mining problem:finding a minimal descriptive set of roles, in: Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, pp. 175–184, 2007.
– reference: Q. Guo, J. Vaidya, V. Atluri, The role hierarchy mining problem: Discovery of optimal role hierarchies, in: Annual Computer Security Applications Conference (ACSAC), pp. 237–246, 2008.
– volume: 9
  start-page: 655
  issue: 5
  year: 2012
  ident: 10.1016/j.future.2014.10.018_br000105
  article-title: Constraint-aware role mining via extended boolean matrix decomposition
  publication-title: IEEE Trans. Dependable Secure Comput.
– ident: 10.1016/j.future.2014.10.018_br000120
  doi: 10.1145/1133058.1133077
– ident: 10.1016/j.future.2014.10.018_br000035
  doi: 10.1145/1266840.1266862
– volume: 54
  start-page: 92
  issue: 12
  year: 2011
  ident: 10.1016/j.future.2014.10.018_br000075
  article-title: Answer set programming at a glance
  publication-title: Commun. ACM
  doi: 10.1145/2043174.2043195
– volume: 4
  start-page: 224
  issue: 3
  year: 2001
  ident: 10.1016/j.future.2014.10.018_br000010
  article-title: Proposed NIST standard for role-based access control
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
  doi: 10.1145/501978.501980
– ident: 10.1016/j.future.2014.10.018_br000040
  doi: 10.1145/1377836.1377838
– ident: 10.1016/j.future.2014.10.018_br000115
– volume: 29
  start-page: 38
  issue: 2
  year: 1996
  ident: 10.1016/j.future.2014.10.018_br000005
  article-title: Role-based access control models
  publication-title: IEEE Computer
  doi: 10.1109/2.485845
– ident: 10.1016/j.future.2014.10.018_br000045
  doi: 10.1109/ACSAC.2008.38
– ident: 10.1016/j.future.2014.10.018_br000095
  doi: 10.1145/1180405.1180424
– ident: 10.1016/j.future.2014.10.018_br000020
  doi: 10.1145/507711.507718
– ident: 10.1016/j.future.2014.10.018_br000030
  doi: 10.1145/1266840.1266870
– volume: 13
  start-page: 36
  issue: 4
  year: 2010
  ident: 10.1016/j.future.2014.10.018_br000050
  article-title: Mining roles with multiple objectives
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
  doi: 10.1145/1880022.1880030
– volume: 3
  start-page: 207
  issue: 4
  year: 2000
  ident: 10.1016/j.future.2014.10.018_br000055
  article-title: Role-based authorization constraints specification
  publication-title: ACM Trans. Inf. Syst. Secur. (TISSEC)
  doi: 10.1145/382912.382913
– ident: 10.1016/j.future.2014.10.018_br000110
  doi: 10.1145/2414456.2414499
– ident: 10.1016/j.future.2014.10.018_br000015
  doi: 10.1109/ACSAC.2001.991529
– ident: 10.1016/j.future.2014.10.018_br000090
  doi: 10.1145/1063979.1064008
– ident: 10.1016/j.future.2014.10.018_br000065
  doi: 10.1145/1030083.1030091
– volume: 8
  start-page: 883
  issue: 6
  year: 2011
  ident: 10.1016/j.future.2014.10.018_br000070
  article-title: On the complexity of authorization in rbac under qualification and security constraints
  publication-title: IEEE Trans. Dependable Secure Comput.
  doi: 10.1109/TDSC.2010.55
– ident: 10.1016/j.future.2014.10.018_br000080
  doi: 10.1145/270152.270159
– ident: 10.1016/j.future.2014.10.018_br000085
  doi: 10.1145/775433.775435
– ident: 10.1016/j.future.2014.10.018_br000060
  doi: 10.1145/775412.775419
– ident: 10.1016/j.future.2014.10.018_br000100
  doi: 10.1007/978-3-642-17714-9_13
– ident: 10.1016/j.future.2014.10.018_br000025
  doi: 10.1145/1542207.1542224
SSID ssj0001731
Score 2.167359
Snippet With the increasing adoption of role-based access control (RBAC) in business security, role mining technology has been widely applied to aid the process of...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 336
SubjectTerms Answer set programming
Constraint
RBAC
Role mining
Title Role mining using answer set programming
URI https://dx.doi.org/10.1016/j.future.2014.10.018
Volume 55
WOSCitedRecordID wos000368652400028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-7115
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001731
  issn: 0167-739X
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bS91AEF6s9qEv3tpStZY89EEokSSbZHcfRay2FBGr7fEp7C30iEYxJ3p-vrO3GDnSi9CXEJZsstn5mJkdZuZD6CNVNOMsqeMcJzrOdZrFnAgal7RMZcKEZLYD349v5PCQjkbsyNOltpZOgDQNnU7Z9X8VNYyBsE3p7D-Iu38pDMA9CB2uIHa4_pXgj02-4KXlffjUta4GsTWp8K2ehHSsy2CwAkGn7Sxi6JS1R4T0bA--1XPveZ_ZAOhPPe4zeWw6wHE3nnYPQNvvzOBofNc9fuys-9XxYaAh7XOTQ_RrpgLGBSRB0RJs6XDBnjglSgl47akr0wxatigGahLjcmBxsWvUNKPMXVzhfNt1VzFpePm2ycTzCvtxm-zvZiVmIXBiBL8lpS_QQkYKBsp6YefL3uhrb59T4lkq_cpDQaXN-pv91tMOy8AJOVlGi_70EO04qa-gOd2soqXAzBF5Rf0abRkQRA4EkQVB5EAQAQiiAQjeoNPPeye7B7HnxIglmIJJLCSWNc8FloonksHxVxEFhiLNRZ0luiBC1UrQMi-ErHUBp1-uVZYxmQmpZSHxWzTfXDX6HYrqnHMpzIGfUrgtGVWlJaNmvM7rUq0hHH68kr5hvOEtuahCZuB55barMttlRmG71lDcz7p2DVP-8DwJe1p5p885cxXA4Lcz1589cwO9egD4ezQ_uen0Jnopbyfj9uaDx8s9sLd93w
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Role+mining+using+answer+set+programming&rft.jtitle=Future+generation+computer+systems&rft.au=Ye%2C+Wei&rft.au=Li%2C+Ruixuan&rft.au=Gu%2C+Xiwu&rft.au=Li%2C+Yuhua&rft.date=2016-02-01&rft.pub=Elsevier+B.V&rft.issn=0167-739X&rft.eissn=1872-7115&rft.volume=55&rft.spage=336&rft.epage=343&rft_id=info:doi/10.1016%2Fj.future.2014.10.018&rft.externalDocID=S0167739X14002118
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon