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
2011 - 2011
50 Datensätze
Zeitschriftenartikel
-
M. Balduccini, S. Woltran:
"Special issue on answer set programming";
AI Communications,
24
(2011),
2;
S. 105
- 106.
-
A. Bohn, I. Feinerer, K. Hornik, P. Mair:
"Content-based social network analysis of mailing lists";
R Journal,
3
(2011),
1;
S. 11
- 18.
-
N. Creignou, J. Schmidt, M. Thomas, S. Woltran:
"Complexity of logic-based argumentation in Post's framework";
Argument & Computation,
2
(2011),
2-3;
S. 107
- 129.
-
W. Dvorak, S. Woltran:
"On the Intertranslatability of Argumentation Semantics";
Journal of Artificial Intelligence Research,
41
(2011),
S. 445
- 475.
-
G. Gottlob, R. Pichler, V. Savenkov:
"Normalization and optimization of schema mappings";
VLDB Journal,
20
(2011),
2;
S. 277
- 302.
-
E. Oikarinen, S. Woltran:
"Characterizing strong equivalence for argumentation frameworks";
Artificial Intelligence,
175
(2011),
14-15;
S. 1985
- 2009.
-
G Post, J Kingston, S. Ahmadi, S. Daskalaki, C. Gogos, J. Kyngas, C. Nurmi, N. Musliu, N. Pillay, H. Santos, A. Schaerf:
"XHSTT: an XML archive for high school timetabling problems in different countries";
Annals of Operations Research,
(*)
(2011).
-
M. Samer, St. Szeider:
"Tractable Cases of the Extended Global Cardinality Constraint";
Constraints,
16
(2011),
1;
S. 1
- 24.
Buchbeiträge
-
W. Faber, S. Woltran:
"Manifold Answer-Set Programs and Their Applications";
in: "Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning",
M. Balduccini, T. Son (Hrg.);
Springer-Verlag,
Berlin Heidelberg,
2011,
ISBN: 978-3-642-20831-7,
S. 44
- 63.
Beiträge in Tagungsbänden
-
S. Woltran:
"Equivalence between Extended Datalog Programs. A Brief Survey";
in: "Datalog Reloaded",
O. de Moor, G. Gottlob, T. Furche, A. Sellers (Hrg.);
Springer,
2011,
ISBN: 978-3-642-24205-2,
S. 106
- 119.
Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag)
-
M. Ali, R. Pichler, H. Truong, S. Dustdar:
"Data Concern Aware Querying for the Integration of Data Services";
Poster: ICEIS,
Beijing;
08.06.2011
- 11.06.2011; in: "Proceedings of the 13th International Conference on Enterprise Information Systems",
J. Cordeiro, X. Li, Z. Zhang, J. Zhang (Hrg.);
SciTePress,
Volume 1
(2011),
ISBN: 978-989-8425-53-9;
S. 111
- 119.
-
M. Ali, R. Pichler, H. Truong, S. Dustdar:
"On Integrating Data Services Using Data Mashups";
Vortrag: Britsh National Conference on Databases - BNCOD,
Manchester, Großbritannien;
12.07.2011
- 14.07.2011; in: "Advances in Databases",
A. A. A. Fernandes, A.J.G. Gray, K. Belhajjame (Hrg.);
LNCS/Springer,
7051
(2011),
ISBN: 978-3-642-24576-3;
S. 132
- 135.
-
G. Brewka, P. Dunne, S. Woltran:
"Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs";
Vortrag: International Joint Conference on Artificial Intelligence (IJCAI),
Barcelon, Spain;
16.07.2011
- 22.07.2011; in: "Proceedings of the 22nd Int. Joint Conference on Artificial Intelligence",
T. Walsh (Hrg.);
AAAI Press,
(2011),
ISBN: 978-1-57735-516-8;
Paper-Nr. 137,
6 S.
-
D. Calvanese, M. Ortiz de la Fuente, M. Simkus:
"Containment of Regular Path Queries under Description Logic Constraints";
Vortrag: International Joint Conference on Artificial Intelligence (IJCAI),
Barcelona, Spain;
16.07.2011
- 22.07.2011; in: "Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence",
T. Walsh (Hrg.);
(2011),
ISBN: 978-1-57735-516-8;
S. 805
- 812.
-
D. Calvanese, M. Ortiz de la Fuente, M. Simkus, G. Stefanoni:
"The Complexity of Conjunctive Query Abduction in DL-Lite";
Vortrag: International Workshop on Description Logics (DL),
Barcelon, Spain;
13.07.2011
- 16.07.2011; in: "CEUR Workshop Proceedings",
R. Rosati, S. Rudolph, M. Zakharyaschev (Hrg.);
CEUR Workshop Proceedings,
745
(2011),
ISSN: 1613-0073;
Paper-Nr. 49,
11 S.
-
W. Dvorak:
"On the Complexity of Computing the Justification Status of an Argument";
Vortrag: First International Workshop on the Theory and Applications of Formal Argumentation (TAFA-11),
Barcelona, Spain;
16.07.2011
- 22.07.2011; in: "Proceedings of the 1st international Workshop on the Theory and Applications of Formal Argumentation",
S. Modgil, N. Oren, F. Toni (Hrg.);
http://ijcai-11.iiia.csic.es/files/proceedings/W25-%20TAFA-post-proceedings.pdf,
(2011),
15 S.
-
W. Dvorak, P. Dunne, S. Woltran:
"Parametric Properties of Ideal Semantics";
Vortrag: International Joint Conference on Artificial Intelligence (IJCAI),
Barcelona, Catalonia, Spain;
16.07.2011
- 22.07.2011; in: "Proceedings of the 22nd Int. Joint Conference on Artificial Intelligence",
T. Walsh (Hrg.);
AAAI Press,
(2011),
ISBN: 978-1-57735-516-8;
Paper-Nr. 148,
6 S.
-
W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran:
"Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.";
Vortrag: International Conference on Applications of Declarative Programming and Knowledge Management,
Vienna, Austria;
28.09.2011
- 30.09.2011; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)",
(2011),
14 S.
-
W. Dvorak, M. Morak, C. Nopp, S. Woltran:
"A Dynamic Programming Reasoner for Abstract Argumentation.";
Vortrag: International Conference on Applications of Declarative Programming and Knowledge Management,
Vienna, Austria;
28.09.2011
- 30.09.2011; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)",
(2011),
5 S.
-
I. Feinerer:
"Efficient configuration and verification of software product lines";
Vortrag: International Software Product Line Conference,
München, Deutschland;
21.08.2011
- 26.08.2011; in: "Proceedings of the 15th International Software Product Line Conference",
I. Schäfer, I. John, K. Schmid (Hrg.);
ACM,
Volume 2
(2011),
ISBN: 978-1-4503-0789-5;
S. 49.
-
I. Feinerer, R. Pichler, E. Sallinger, V. Savenkov:
"On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies";
Vortrag: AMW - Alberto Mendelzon International Workshop on Foundations of Data Management,
Santiago, Chile;
09.05.2011
- 12.05.2011; in: "CEUR Workshop Proceedings",
P. Barceló, V. Tannen (Hrg.);
749
(2011),
ISSN: 1613-0073;
Paper-Nr. 5,
13 S.
-
I. Feinerer, G. Salzer, T. Sisel:
"Reducing multiplicities in class diagrams";
Vortrag: 14th International Conference on Model Driven Engineering Languages and Systems,
Wellington, New Zealand;
16.10.2011
- 21.10.2011; in: "Lecture Notes in Computer Science",
6981
(2011),
ISBN: 978-3-642-24484-1;
S. 379
- 393.
-
J. Gärtner, N. Musliu, W. Schafhauser, W. Slany:
"TEMPLE - A Domain Specific Language for Modeling and Solving Staff Scheduling Problems";
Vortrag: Symposium on Computational Intelligence in Scheduling (SCIS),
Paris, France;
11.04.2011
- 15.04.2011; in: "Proceedings of 2011 Symposium on Computational Intelligence in Scheduling",
(2011),
ISBN: 978-1-61284-195-3;
S. 58
- 64.
-
S. Gaggl, S. Woltran:
"Strong Equivalence for Argumentation Semantics based on Conflict-free Sets";
Vortrag: European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU),
Belfast, Northern Ireland;
29.06.2011
- 01.07.2011; in: "Lecture Notes in Artificial Intelligence",
W. Liu (Hrg.);
Springer,
6717
(2011),
ISSN: 0302-9743;
S. 38
- 49.
-
M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran:
"A New Tree-Decomposition Based Algorithm for Answer Set Programming";
Poster: 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence,
Boca Raton, Florida USA;
07.11.2011
- 09.11.2011; in: "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence",
T. M. Khoshgoftaar, X. Zhu (Hrg.);
(2011),
ISSN: 1082-3409;
S. 916
- 918.
-
N. Musliu:
"Constructing Cyclic Staff Schedules by Iterated Local Search";
Vortrag: Metaheuristic International Conference (MIC),
Udine;
25.07.2011
- 28.07.2011; in: "Proceedings of the 9th Metaheuristic International Conference (MIC 2011)",
(2011),
ISBN: 978-88-900984-3-7;
S. 655
- 657.
-
M. Ortiz de la Fuente, M. Simkus, S. Rudolph:
"Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ";
Vortrag: International Joint Conference on Artificial Intelligence (IJCAI),
Barcelona, Spain;
16.07.2011
- 22.07.2011; in: "Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence",
T. Walsh (Hrg.);
(2011),
ISBN: 978-1-57735-516-8;
S. 1039
- 1044.
-
R. Pichler, E. Sallinger, V. Savenkov:
"Relaxed Notions of Schema Mapping Equivalence Revisited";
Vortrag: International Conference on Database Theory (ICDT),
Uppsala, Schweden;
21.03.2011
- 25.03.2011; in: "Proceedings of the 14th International Conference Database Theory",
T. Milo (Hrg.);
ACM,
(2011),
ISBN: 978-1-4503-0529-7;
Paper-Nr. 10,
12 S.
-
R. Pichler, S. Skritek:
"The Complexity of Evaluating Tuple Generating Dependencies";
Vortrag: International Conference on Database Theory (ICDT),
Uppsala, Schweden;
21.03.2011
- 25.03.2011; in: "Proceedings of the 14th International Conference on Database Theory",
T. Milo (Hrg.);
ACM,
(2011),
ISBN: 978-1-4503-0529-7;
Paper-Nr. 23,
12 S.
-
R. Pichler, S. Skritek:
"Tractable Counting of the Answers to Conjunctive Queries";
Vortrag: AMW - Alberto Mendelzon International Workshop on Foundations of Data Management,
Santiago, Chile;
09.05.2011
- 12.05.2011; in: "CEUR Workshop Proceedings",
P. Barceló, V. Tannen (Hrg.);
CEUR Workshop Proceedings,
749
(2011),
ISSN: 1613-0073;
Paper-Nr. 4,
12 S.
-
M. Triska, N. Musliu:
"A Constraint Programming Application for Rotating Workforce Scheduling";
Vortrag: 24th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems,
Syracuse, NY;
28.06.2011
- 01.07.2011; in: "Developing Concepts in Applied Intelligence: 24th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems",
Studies in Computational Intelligence,
363
(2011),
S. 83
- 88.
Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag)
-
M. Alviano, W. Faber, S. Woltran:
"Complexity of Super-Coherence Problems in ASP";
Vortrag: Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010,
Lexington, Kentucky, USA;
06.07.2011
- 10.07.2011.
-
W. Dvorak:
"On the Intertranslatability of Argumentation Semantics";
Vortrag: LAF (London Argumentation Forum),
London, Großbritannien;
25.03.2011.
-
S. Gaggl:
"Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.";
Vortrag: Computational Logic and Knowledge Representation Workshop,
Toulouse, Frankreich (eingeladen);
21.10.2011
- 22.10.2011.
-
B. Krüpl-Sypien, R. Fayzrakhmanov, W. Holzinger, M. Panzenböck:
"A Versatile Model for Web Page Representation, Information Extraction and Content Re-Packaging";
Vortrag: The ACM Symposium on Document Engineering - DocEng,
Mountain View, California, USA;
19.09.2011
- 22.09.2011.
-
M. Lackner, A. Pfandler:
"Algorithms for finding minimal models";
Vortrag: Workshop - Parameterized Complexity: Not About Graphs,
Darwin, Australien;
05.08.2011
- 08.08.2011.
-
A. Pfandler, M. Lackner:
"Hardness results for Weighted Minimal Model SAT";
Vortrag: Workshop - Parameterized Complexity: Not About Graphs,
Darwin, Australien;
05.08.2011
- 08.08.2011.
-
S. Woltran:
"Computational Aspects of Formal Argumentation";
Vortrag: TU Dresden,
Dresden, Deutschland;
25.03.2011.
-
S. Woltran:
"Strong Equivalence in Argumentation";
Vortrag: Universität Leipzig,
Leipzig, Deutschland;
22.06.2011.
Dissertationen (eigene und begutachtete)
-
M. Ali:
"Distributed Heterogeneous Web Data Sources Integration - DeXIN Approach";
Betreuer/in(nen), Begutachter/in(nen): R. Pichler, U. Zdun;
Institut für Informationssysteme,
2011;
Rigorosum: 26.08.2011.
Diplom- und Master-Arbeiten (eigene und betreute)
-
M. Kronegger:
"LinkEfficient planning with QBF-solvers";
Betreuer/in(nen): R. Pichler, A. Pfandler;
f. Informationssysteme,
2011;
Abschlussprüfung: 13.09.2011.
-
A. Lehrbaum:
"A New Hyperheuristic Algorithm for Cross-Domain Search Problems";
Betreuer/in(nen): N. Musliu;
Institut für Informationssysteme,
2011;
Abschlussprüfung: 11/2011.
-
M. Morak:
"dynASP - A Dynamic-Programming Based Answer Set Programming Solver";
Betreuer/in(nen): S. Woltran, St. Rümmele;
Institut für Informationssysteme,
2011;
Abschlussprüfung: 27.01.2011.
-
L. Nguyen:
"An Efficient Algorithm for Phylogeny Reconstruction by Maximum Likelihood";
Betreuer/in(nen): N. Musliu, A. von Haeseler;
Institut für Informationssysteme,
2011;
Abschlussprüfung: 04/2011.
Wissenschaftliche Berichte
-
W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran:
"Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems";
Bericht für TU Wien, Institut für Informationssysteme;
Berichts-Nr. DBAI-TR-2011-70,
2011;
32 S.
-
W. Dvorak, R. Pichler, S. Woltran:
"Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation";
Bericht für TU Wien, Institut für Informationssysteme;
Berichts-Nr. DBAI-TR-2011-74,
2011;
55 S.
-
C. Feier, T. Eiter, M. Kifer, A. Mosca, M. Rezk, R. Rosati, M. Ortiz de la Fuente, M. Simkus, T. Tran, G. Xiao:
"D3.4 Converged and Optimized Combinations of Rules and Ontologies";
Bericht für ONTORULE project;
Berichts-Nr. D3.4,
2011;
163 S.
-
S. Gaggl, S. Woltran:
"Strong Equivalence for Argumentation Semantics based on Conflict-free Sets";
Bericht für TU Wien, Institut für Informationssysteme;
Berichts-Nr. DBAI-TR-2011-68,
2011;
19 S.
-
M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran:
"Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming";
Berichts-Nr. DBAI-TR-2011-73,
2011;
19 S.
-
M. Morak, S. Woltran:
"Preprocessing of Complex Non-Ground Rules in Answer Set Programming";
Berichts-Nr. DBAI-TR-2011-72,
2011;
14 S.