Publikationsliste für Angehörige von
E192 - Institut für Logic and Computation
E192-02 Database and AI
als Autorinnen / Autoren bzw. wesentlich beteiligte Personen
2017 - 2017
59 Datensätze
Zeitschriftenartikel
-
M. Abseher, N. Musliu, S. Woltran:
"Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning";
Journal of Artificial Intelligence Research,
58
(2017),
S. 829
- 858.
-
S. Ahmetaj, M. Ortiz de la Fuente, D. Calvanese, M. Simkus:
"Managing Change in Graph-Structured Data Using Description Logics";
ACM Transactions on Computational Logic,
18
(2017),
4;
S. 1
- 35.
-
B. Bliem, R. Pichler, S. Woltran:
"Implementing Courcelle's Theorem in a declarative framework for dynamic programming";
Journal of Logic and Computation,
27
(2017),
4;
S. 1067
- 1094.
-
G. Brewka, St. Ellmauthaler, H. Strass, J. P. Wallner, S. Woltran:
"Abstract Dialectical Frameworks. An Overview";
IfCoLog Journal of Logics and their Applications,
4
(2017),
8;
S. 2263
- 2318.
-
E. Demirovic, N. Musliu:
"MaxSAT-based large neighborhood search for high school timetabling";
Computers & Operations Research,
78
(2017),
S. 172
- 180.
-
E. Demirovic, N. Musliu:
"Modeling and solving a real-life multi-skill shift design problem";
Annals of Operations Research,
252
(2017),
2;
S. 365
- 382.
-
E. Demirovic, N. Musliu:
"Modeling high school timetabling with bitvectors";
Annals of Operations Research,
252
(2017),
2;
S. 215
- 238.
-
W. Dvorak, P. Dunne:
"Computational Problems in Formal Argumentation and their Complexity";
IfCoLog Journal of Logics and their Applications,
4
(2017),
8;
S. 2557
- 2622.
-
W. Dvorak, C. Spanring:
"Comparing the expressiveness of argumentation semantics";
Journal of Logic and Computation,
27
(2017),
5;
S. 1489
- 1521.
-
U. Egly, M. Kronegger, F. Lonsing, A. Pfandler:
"Conformant planning as a case study of incremental QBF solving";
Annals of Mathematics and Artificial Intelligence,
80
(2017),
1;
S. 21
- 45.
-
G. Erdélyi, M. Lackner, A. Pfandler:
"Computational Aspects of Nearly Single-Peaked Electorates";
Journal of Artificial Intelligence Research,
58
(2017),
S. 1.
-
R. Goncalves, M. Knorr, J. Leite, S. Woltran:
"When you must forget: Beyond strong persistence when forgetting in answer set programming";
Theory and Practice of Logic Programming,
17
(2017),
5-6;
S. 837
- 854.
-
J. Hägglund, A. Hoffmann-Ostenhof:
"Construction of permutation snarks";
Journal of Combinatorial Theory Series B,
122
(2017),
S. 55
- 67.
-
A. Haret, St. Rümmele, S. Woltran:
"Merging in the Horn Fragment";
ACM Transactions on Computational Logic,
18
(2017),
1;
S. 1
- 32.
-
J. Maly, S. Woltran:
"Ranking Specific Sets of Objects";
Datenbank Spektrum - Zeitschrift für Datenbanktechnologie und Information Retrieval,
17
(2017),
3;
S. 255
- 265.
-
N. Musliu, F. Winter:
"A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search";
IEEE Intelligent Systems,
32
(2017),
2;
S. 52
- 62.
-
K. Sylejmani, J. Dorn, N. Musliu:
"Planning the trip itinerary for tourist groups";
Journal of Information Technology and Tourism (eingeladen),
17
(2017),
1;
S. 1
- 40.
-
J. P. Wallner, A. Niskanen, M. Järvisalo:
"Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation";
Journal of Artificial Intelligence Research,
60
(2017),
S. 1
- 40.
Beiträge in Tagungsbänden
-
A. Pfandler, M. Endres:
"Workshop Präferenzen und Personalisierung in der Informatik (PPI17)";
in: "Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz "Datenbanksysteme für Business, Technologie und Web" (BTW)",
Gesellschaft für Informatik,
2017,
S. 155
- 157.
Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag)
-
M. Abseher, N. Musliu, S. Woltran:
"htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond";
Vortrag: 14th International Conference on Integration of AI and OR Teniques (CPAIOR) 2017,
Padua, Italien;
05.06.2017
- 08.06.2017; in: "CPAIOR 2017",
Lecture Notes in Computer Science / Springer,
10335
(2017),
ISBN: 978-3-319-59775-1;
S. 376
- 386.
-
S. Arming, E. Bartocci, A. Sokolova:
"SEA-PARAM: Exploring Schedulers in Parametric MDPs";
Vortrag: QAPL 2017: the 15 International Workshop on Quantitative Aspects of Programming Languages and Systems,
Uppsala, Sweden;
23.04.2017; in: "Proc. of QAPL 2017: the 15 International Workshop on Quantitative Aspects of Programming Languages and Systems",
EPCTS,
250
(2017),
S. 25
- 38.
-
L. Bajraktari, M. Ortiz de la Fuente, M. Simkus:
"Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming";
Vortrag: 30th International Workshop on Description Logics,
Montpellier, France (eingeladen);
18.07.2017
- 21.07.2017; in: "Proceedings of the 30th International Workshop on Description Logics",
A. Artale, B. Glimm, R. Kontchakov (Hrg.);
CEUR Workshop Proceedings,
1879
(2017),
ISSN: 1613-0073;
S. 1
- 13.
-
R. Baumann, C. Spanring:
"A Study of Unrestricted Abstract Argumentation Frameworks";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "Proceedings of the 26th International Joint Conference on Artificial Intelligence",
(2017),
S. 807
- 813.
-
L. Bellomarini, G. Gottlob, A. Pieris, E. Sallinger:
"Swift Logic for Big Data and Knowledge Graphs";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia (eingeladen);
19.08.2017
- 25.08.2017; in: "26th International Joint Conferences on Artificial Intelligence Organization",
(2017),
S. 2
- 10.
-
B. Bliem, M. Moldovan, M. Morak, S. Woltran:
"The Impact of Treewidth on ASP Grounding and Solving";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)",
AAAI Press,
(2017),
S. 852
- 858.
-
G. Charwat, S. Woltran:
"Expansion-based (QBF) Solving on Tree Decompositions";
Vortrag: 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017),
Bari, Italien;
14.11.2017
- 15.11.2017; in: "Proceedings of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017)",
M. Maratea, I. Serina (Hrg.);
CEUR-WS.org,
2011
(2017),
S. 16
- 26.
-
N. Creignou, M. Kröll, R. Pichler, S. Skritek, H. Vollmer:
"On the Complexity of Hard Enumeration Problems";
Vortrag: Language and Automata Theory and Applications - LATA 2017,
Schweden;
06.03.2017
- 09.03.2017; in: "Language and Automata Theory and Applications - 11th International Conference, LATA 2017",
(2017),
S. 183
- 195.
-
T. Csar, M. Lackner, R. Pichler, E. Sallinger:
"Computational Social Choice in the Clouds";
Vortrag: Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz "Datenbanksysteme für Business, Technologie und Web" (BTW),
Stuttgart;
07.03.2017; in: "Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz "Datenbanksysteme für Business, Technologie und Web" (BTW)",
(2017),
S. 163
- 167.
-
T. Csar, M. Lackner, R. Pichler, E. Sallinger:
"Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458";
Vortrag: AAAI 2017,
San Francisco;
04.02.2017
- 09.02.2017; in: "AAAI 2017",
(2017),
S. 451
- 458.
-
M. Diller, T. Linsbichler, S. Woltran, G. Brewka, G. Heissenberger:
"Solving Advanced Argumentation Problems with Answer-Set Programming";
Vortrag: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17),
San Francisco, California, USA;
04.02.2017
- 09.02.2017; in: "Proceedings of the 31st AAAI Conference on Artificial Intelligence",
(2017),
S. 1077
- 1083.
-
W. Dvorak:
"A General Notion of Equivalence for Abstract Argumentation";
Vortrag: KI 2017,
Dortmund (eingeladen);
25.09.2017
- 29.09.2017; in: "A General Notion of Equivalence for Abstract Argumentation",
(2017),
S. 1.
-
W. Dvorak, K. Chatterjee, M. Henzinger, V. Loitzenbauer:
"Improved Set-based Symbolic Algorithms for Parity Games";
Vortrag: Computer Science Logic - CSL 2017,
Stockholm;
20.08.2017
- 24.08.2017; in: "Computer Science Logic - CSL 2017",
(2017),
S. 1
- 21.
-
W. Dvorak, T. Linsbichler, S. Woltran, R. Baumann:
"A General Notion of Equivalence for Abstract Argumentation";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "IJCAI 2017",
(2017),
S. 800
- 806.
-
C. Erkinger, N. Musliu:
"Personnel Scheduling as Satisfiability Modulo Theorie";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017",
ijcai.org,
(2017),
ISBN: 978-0-9992411-0-3;
S. 614
- 621.
-
J. Fichte, M. Hecher, M. Morak, S. Woltran:
"DynASP2.5: Dynamic Programming on Tree Decompositions in Action";
Vortrag: International Symposium on Parameterized and Exact Computation (IPEC),
TU Wien;
04.09.2017
- 08.09.2017; in: "Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC'17)",
D. Lokshtanov, N. Nishimura (Hrg.);
(2017),
S. 1
- 13.
-
J. Fichte, M. Kronegger, S. Woltran:
"A Multiparametric View on Answer Set Programming";
Vortrag: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017),
Helsinki, Finland;
03.07.2017
- 06.07.2017; in: "Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR'17)",
(2017),
S. 1
- 14.
-
J. Fichte, N. Lodha, S. Szeider:
"SAT-Based Local Improvement for Finding Tree Decompositions of Small Width";
Vortrag: 20th International Conference on Theory and Applications of Satisfiability Testing - SAT 2017,
Melbourne, Australien;
28.08.2017
- 01.09.2017; in: "Proceedings on the 20th International Conference on Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017.",
S. Gaspers, T. Walsh (Hrg.);
Lecture Notes in Computer Science (LNCS) / Springer,
10491
(2017),
ISBN: 978-3-319-66263-3;
S. 401
- 411.
-
J. Fichte, S. Szeider:
"Backdoor Trees for Answer Set Programming";
Vortrag: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017),
Espoo, Finland;
03.07.2017
- 06.07.2017; in: "Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR'17",
B. Bogaerts, A. Harrison (Hrg.);
(2017),
ISSN: 1613-0073;
S. 1
- 16.
-
G. Gottlob, R. Pichler, E. Sallinger:
"Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability";
Vortrag: AMW - Alberto Mendelzon International Workshop on Foundations of Data Management,
Montevideo, Uruguay;
07.06.2017
- 09.06.2017; in: "11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, AMW 2017",
E. Sallinger (Hrg.);
CEUR Workshop Proceedings / CEUR-WS.org,
1912
(2017),
ISSN: 1613-0073;
S. 1
- 5.
-
A. Haret, S. Woltran:
"Deviation in Belief Change on Fragments of Propositional Logic";
Vortrag: 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and 5th Workshop KI & Kognition (KIK-2017) on Formal and Cognitive Reasoning,
Dortmund;
26.09.2017; in: "Proceedings of the 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and the 5th Workshop KI & Kognition (KIK-2017)",
C. Beierle, G. Kern-Isberner, M. Ragni, F. Stolzenburg (Hrg.);
CEUR Workshop Proceedings,
1928
(2017),
ISSN: 1613-0073;
Paper-Nr. 6,
13 S.
-
M. Hecher:
"Structure-Driven Answer-Set Solving";
Vortrag: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017),
Helsinki, Finland;
03.07.2017
- 06.07.2017; in: "4th International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC)",
(2017),
S. 1.
-
M. Hecher, J. Fichte, M. Morak, S. Woltran:
"Answer Set Solving with Bounded Treewidth Revisited";
Vortrag: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017),
Helsinki, Finland;
03.07.2017
- 06.07.2017; in: "Proc. of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017)",
M. Balduccini, T. Janhunen (Hrg.);
Springer,
(2017),
S. 132
- 145.
-
L. Kletzander, N. Musliu:
"A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem";
Vortrag: 14th International Conference on Integration of AI and OR Teniques (CPAIOR) 2017,
Padua, Italien;
05.06.2017
- 08.06.2017; in: "ntegration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017",
Lecture Notes in Computer Science (LNCS) / Springer,
10335
(2017),
ISBN: 978-3-319-59775-1;
S. 344
- 358.
-
M. Kröll, R. Pichler, S. Woltran:
"On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017",
(2017),
S. 1145
- 1152.
-
T. Lehtonen, J. P. Wallner, M. Järvisalo:
"From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning";
Vortrag: European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU),
Lugano;
10.07.2017
- 14.07.2017; in: "Proceedings of Fourteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2017)",
A. Antonucci, L. Cholvy, O. Papini (Hrg.);
Springer,
10369
(2017),
ISBN: 978-3-319-61580-6;
S. 57
- 68.
-
J. Maly, S. Woltran:
"Ranking Specific Sets of Objects";
Vortrag: Workshop Präferenzen und Personalisierung in der Informatik,
Stuttgart;
07.03.2017; in: "Workshop Präferenzen und Personalisierung in der Informatik",
(2017),
S. 193
- 201.
-
M. Moldovan, B. Bliem, M. Morak, S. Woltran, B. Bliem:
"The Impact of Treewidth on {ASP} Grounding and Solving";
Vortrag: 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017),
Espoo, Helsinki;
03.07.2017; in: "Proceedings of the 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017)",
(2017),
S. 1
- 13.
-
M. Morak, M. Bichler, S. Woltran:
"lpopt: A Rule Optimization Tool for Answer Set Programming";
Poster: 26th InternationalSymposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016),
Edinburgh, UK;
06.09.2017
- 08.09.2017; in: "Proceedings of the 26th InternationalSymposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016)",
M. Hermenegildo, P. Lopez-Garcia (Hrg.);
Lecture Notes in Computer Science,
10184
(2017),
ISBN: 978-3-319-63138-7;
S. 114
- 130.
-
M. Morak, A. Pieris, P. Bourhis:
"Making Cross Products and Guarded Ontology Languages Compatible";
Vortrag: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017),
Melbourne, Australia;
19.08.2017
- 25.08.2017; in: "Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)",
(2017),
S. 880
- 886.
-
A. Pieris, M. Morak, M. Alviano:
"Stable Model Semantics for Tuple-Generating Dependencies Revisited";
Vortrag: 36th ACM Symposium on Principles of Database Systems (PODS 2017),
Illinois, USA;
14.05.2017
- 19.05.2017; in: "Proc. of the 36th ACM Symposium on Principles of Database Systems (PODS 2017)",
E. Sallinger, J. Van den Bussche (Hrg.);
ACM,
(2017),
S. 377
- 388.
-
G. Taghizadeh, N. Musliu:
"A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search";
Vortrag: EvoCOP 2017,
Amsterdam, Niederlande;
19.04.2017
- 21.04.2017; in: "Evolutionary Computation in Combinatorial Optimization - 17th European Conference, EvoCOP 2017",
Lecture Notes in Computer Science / Springer,
10197
(2017),
ISBN: 978-3-319-55452-5;
S. 30
- 43.
-
S. Woltran:
"Towards Preprocessing for Abstract Argumentation Frameworks";
Vortrag: International Workshop on Defeasible and Ampliative Reasoning 2017,
Espoo, Finnland (eingeladen);
03.07.2017; in: "Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17)",
(2017),
S. 1.
Dissertationen (eigene und begutachtete)
-
M. Abseher:
"Tailored Tree Decompositions for Efficient Problem Solving";
Betreuer/in(nen), Begutachter/in(nen): S. Woltran, L. Di Gaspero, R. Niedermeier;
Institut fuer Informationssysteme,
2017;
Rigorosum: 28.04.2017.
-
B. Bliem:
"Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs";
Betreuer/in(nen), Begutachter/in(nen): S. Woltran, F. Scarcello, G. Woeginger;
Institut für Informationssysteme,
2017;
Rigorosum: 20.10.2017.
-
G. Charwat:
"BDD-based Dynamic Programming on Tree Decompositions - Towards an Alternative Approach for Efficient (QBF) Solving";
Betreuer/in(nen), Begutachter/in(nen): L. Pulina, M. Seidl, S. Woltran;
Institut fuer Informationssysteme,
2017;
Rigorosum: 22.09.2017.
-
T. Linsbichler:
"Advances in Abstract Argumentation - Expressiveness and Dynamics";
Betreuer/in(nen), Begutachter/in(nen): S. Woltran, W. Dvorak;
Institut fuer Informationssysteme,
2017;
Rigorosum: 30.06.2017.
-
S. Polberg:
"Developing the Abstract Dialectical Framework";
Betreuer/in(nen), Begutachter/in(nen): S. Woltran, L. van der Torre, S. Modgil;
Institut fuer Informationssysteme,
2017;
Rigorosum: 16.08.2017.
-
C. Spanring:
"Set- and Graph-theoretic Investigations in Abstract Argumentation";
Betreuer/in(nen), Begutachter/in(nen): P. Dunne, D. Grossi, S. Woltran, F. Wolter, P. Baroni;
Institut fuer Informationssysteme,
2017;
Rigorosum: 13.09.2017.
Diplom- und Master-Arbeiten (eigene und betreute)
-
A. Keshavarzi:
"Investigating subclasses of abstract dialectical frameworks";
Betreuer/in(nen): S. Woltran, M. Diller, T. Linsbichler;
Institut fuer Informationssysteme,
2017;
Abschlussprüfung: 03.10.2017.