@InProceedings{bliem:OASIcs.ICLP.2017.12, author = {Bliem, Bernhard}, title = {{Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs}}, booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)}, pages = {12:1--12:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-058-3}, ISSN = {2190-6807}, year = {2018}, volume = {58}, editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.12}, URN = {urn:nbn:de:0030-drops-84656}, doi = {10.4230/OASIcs.ICLP.2017.12}, annote = {Keywords: answer set programming, treewidth, secure set, defensive alliance, parameterized complexity} }
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing