<div class="csl-bib-body">
<div class="csl-entry">Abseher, M., Bliem, B., Charwat, G., Dusberger, F., & Woltran, S. (2020). Computing Secure Sets in Graphs using Answer Set Programming. <i>Journal of Logic and Computation</i>, <i>30</i>(4), 837–862. https://doi.org/10.1093/logcom/exv060</div>
</div>
-
dc.identifier.issn
0955-792X
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/151550
-
dc.description.abstract
The notion of secure sets is a rather new concept in the area of graph theory. Applied to social network analysis, the goal is to identify groups of entities that can repel any attack or influence from the outside. In this article, we tackle this problem by utilizing Answer Set Programming (ASP). It is known that verifying whether a set is secure in a graph is already co-NP-hard. Therefore, the problem of enumerating all secure sets is challenging for ASP and its systems. In particular, encodings for this problem seem to require disjunction and also recursive aggregates. Here, we provide such encodings and analyse their performance using the Clingo system. Furthermore, we study several problem variants, including multiple secure or insecure sets, and weighted graphs.
en
dc.description.sponsorship
Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
-
dc.description.sponsorship
Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
-
dc.language.iso
en
-
dc.publisher
OXFORD UNIV PRESS
-
dc.relation.ispartof
Journal of Logic and Computation
-
dc.subject
Software
-
dc.subject
Theoretical Computer Science
-
dc.subject
Hardware and Architecture
-
dc.subject
Logic
-
dc.subject
secure sets
-
dc.subject
graphs
-
dc.subject
Arts and Humanities (miscellaneous)
-
dc.subject
answer set
-
dc.subject
computing
-
dc.title
Computing Secure Sets in Graphs using Answer Set Programming
en
dc.type
Artikel
de
dc.type
Article
en
dc.description.startpage
837
-
dc.description.endpage
862
-
dc.relation.grantno
P25607-N23
-
dc.relation.grantno
Y 698-N23
-
dc.type.category
Original Research Article
-
tuw.container.volume
30
-
tuw.container.issue
4
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
tuw.project.title
Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving
-
tuw.project.title
START
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Journal of Logic and Computation
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
tuw.publisher.doi
10.1093/logcom/exv060
-
dc.identifier.eissn
1465-363X
-
dc.description.numberOfPages
26
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
item.grantfulltext
none
-
item.languageiso639-1
en
-
item.openairetype
Artikel
-
item.openairetype
Article
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
crisitem.author.dept
E184 - Institut für Informationssysteme
-
crisitem.author.dept
E184 - Institut für Informationssysteme
-
crisitem.author.dept
E192 - Institut für Logic and Computation
-
crisitem.author.dept
E186 - Institut für Computergraphik und Algorithmen
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.parentorg
E180 - Fakultät für Informatik
-
crisitem.author.parentorg
E180 - Fakultät für Informatik
-
crisitem.author.parentorg
E180 - Fakultät für Informatik
-
crisitem.author.parentorg
E180 - Fakultät für Informatik
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)