{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:38:41Z","timestamp":1740141521359,"version":"3.37.3"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T00:00:00Z","timestamp":1440979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P25607 and Y698"],"award-info":[{"award-number":["P25607 and Y698"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007223","name":"Vienna University of Technology","doi-asserted-by":"publisher","award":["9006.09\/008"],"award-info":[{"award-number":["9006.09\/008"]}],"id":[{"id":"10.13039\/100007223","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>","DOI":"10.1093\/logcom\/exv060","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T01:14:10Z","timestamp":1441156450000},"page":"837-862","source":"Crossref","is-referenced-by-count":4,"title":["Computing secure sets in graphs using answer set programming"],"prefix":"10.1093","volume":"30","author":[{"given":"Michael","family":"Abseher","sequence":"first","affiliation":[{"name":"Institute of Information Systems 184\/2, TU Wien, Favoritenstrasse 9\u201311, 1040 Vienna, Austria"}]},{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[{"name":"Institute of Information Systems 184\/2, TU Wien, Favoritenstrasse 9\u201311, 1040 Vienna, Austria"}]},{"given":"G\u00fcnther","family":"Charwat","sequence":"first","affiliation":[{"name":"Institute of Information Systems 184\/2, TU Wien, Favoritenstrasse 9\u201311, 1040 Vienna, Austria"}]},{"given":"Frederico","family":"Dusberger","sequence":"first","affiliation":[{"name":"Institute of Information Systems 184\/2, TU Wien, Favoritenstrasse 9\u201311, 1040 Vienna, Austria"}]},{"given":"Stefan","family":"Woltran","sequence":"first","affiliation":[{"name":"Institute of Information Systems 184\/2, TU Wien, Favoritenstrasse 9\u201311, 1040 Vienna, Austria"}]}],"member":"286","published-online":{"date-parts":[[2015,8,31]]},"reference":[{"key":"2020062122333362000_B1"},{"key":"2020062122333362000_B2"},{"key":"2020062122333362000_B3"},{"key":"2020062122333362000_B4"},{"key":"2020062122333362000_B5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"54","author":"Brewka","year":"2011","journal-title":"Communications of the ACM"},{"key":"2020062122333362000_B6","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1016\/j.dam.2007.03.009","article-title":"Security in graphs","volume":"155","author":"Brigham","year":"2007","journal-title":"Discrete Applied Mathematics"},{"key":"2020062122333362000_B7"},{"key":"2020062122333362000_B8"},{"key":"2020062122333362000_B9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/19462166.2010.486479","article-title":"Answer-set programming encodings for argumentation frameworks","volume":"1","author":"Egly","year":"2010","journal-title":"Argument & Computation"},{"key":"2020062122333362000_B10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","article-title":"On the computational cost of disjunctive logic programming: propositional case","volume":"15","author":"Eiter","year":"1995","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2020062122333362000_B11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/261124.261126","article-title":"Disjunctive datalog","volume":"22","author":"Eiter","year":"1997","journal-title":"ACM Transactions on Database Systems"},{"key":"2020062122333362000_B12"},{"key":"2020062122333362000_B13","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","article-title":"Semantics and complexity of recursive aggregates in answer set programming","volume":"175","author":"Faber","year":"2011","journal-title":"Artificial Intelligence"},{"key":"2020062122333362000_B14"},{"key":"2020062122333362000_B15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1970398.1970401","article-title":"Logic programs with propositional connectives and aggregates","volume":"12","author":"Ferraris","year":"2011","journal-title":"ACM Transactions on Computational Logic"},{"key":"2020062122333362000_B16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1017\/S1471068403001923","article-title":"Weight constraints as nested expressions","volume":"5","author":"Ferraris","year":"2005","journal-title":"Theory and Practice of Logic Programming"},{"key":"2020062122333362000_B17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: the Potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Communications"},{"key":"2020062122333362000_B18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S1471068410000554","article-title":"Detecting inconsistencies in large biological networks with answer set programming","volume":"11","author":"Gebser","year":"2011","journal-title":"Theory and Practice of Logic Programming"},{"key":"2020062122333362000_B19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"2020062122333362000_B20"},{"key":"2020062122333362000_B21"},{"key":"2020062122333362000_B22"},{"key":"2020062122333362000_B23"},{"key":"2020062122333362000_B24"},{"key":"2020062122333362000_B25","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S147106841100007X","article-title":"Team-building with answer set programming in the Gioia-Tauro seaport","volume":"12","author":"Ricca","year":"2012","journal-title":"Theory and Practice of Logic Programming"},{"key":"2020062122333362000_B26","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002936","article-title":"A constructive semantic characterization of aggregates in answer set programming","volume":"7","author":"Son","year":"2007","journal-title":"Theory and Practice of Logic Programming"},{"key":"2020062122333362000_B27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"Wasserman","year":"1994"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/837\/33410475\/exv060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/4\/837\/33410475\/exv060.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T02:33:43Z","timestamp":1592793223000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/4\/837\/2917835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,31]]},"references-count":27,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,8,31]]},"published-print":{"date-parts":[[2020,6,5]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv060","relation":{},"ISSN":["1465-363X","0955-792X"],"issn-type":[{"type":"electronic","value":"1465-363X"},{"type":"print","value":"0955-792X"}],"subject":[],"published-other":{"date-parts":[[2020,6]]},"published":{"date-parts":[[2015,8,31]]}}}