Reinhard Pichler
Univ.Prof. Mag.rer.nat. Dr.techn.
Research Focus
- Logic and Computation: 100%
Research Areas
- Knowledge Representation and Reasoning, Database Theory, Parameterized Complexity, Complexity Theory, Computational Logic, Information Integration, Semantic Web
About
Basic Research in Database Theory and Computational Logic with focus on: Properties of Query Languages, Information Integration and Knowledge Representation and Reasoning
Roles
-
Full Professor
Databases and Artificial Intelligence, E192-02 -
Faculty Council
Chair -
Curriculum Commission for Informatics
Principal Member -
Curriculum Commission for Business Informatics
Substitute Member
Courses
2024W
- Bachelor Thesis / 184.691 / PR
- Complexity theory / 181.142 / VU
- Doctoral & Master Students Seminar / 181.223 / SE
- Introduction to Quantum Computing, Complexity Theory, and Algorithmics / 192.042 / VU
- IT Projects for Youth / 192.055 / PR
- IT Projects for Youth / 192.058 / UE
- Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
- Quantum Computing, Complexity Theory, and Algorithmics / 192.043 / VU
- Scientific Research and Writing / 193.052 / SE
- Seminar Database Systems / 181.201 / SE
- Seminar for Master Students in Logic and Computation / 180.773 / SE
- Theoretical Computer Science / 192.017 / VU
2025S
- IT Projects for Youth / 192.055 / PR
- IT Projects for Youth / 192.058 / UE
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
Projects
-
Decompose and Conquer: Fast Query Processing via Decomposition
2023 – 2027 / Vienna Science and Technology Fund (WWTF)
Publications: 191698 / 192942 / 192932 / 193572 / 193568 / 193083 / 195921 / 195923 / 197724 / 203905 -
HyperTrac: hypergraph Decompositions and Tractability
2018 – 2022 / Austrian Science Fund (FWF)
Publications: 139811 / 138401 / 139803 / 144347 / 142192 / 152302 / 141102 / 143198 / 175761 / 175762 / 192683 / 191698 / 192931 / 193564 / 195921 / 196500 / 55515 / 55516 / 55517 / 57529 / 57567 / 57860 / 57861 / 57862 / 57864 / 57879 / 58146 / 58227 / 58229 / 58376 -
Fixed-Parameter Tractability in Artificial Intelligence and Reasoning (FAIR)
2013 – 2018 / Austrian Science Fund (FWF)
Publications: 142906 / 143764 / 145423 / 145572 / 147015 / 147186 / 147322 / 149495 / 151027 / 151539 / 151540 / 155431 / 54717 / 54784 / 54787 / 54788 / 54789 / 54790 / 54792 / 54793 / 54860 / 55042 / 55043 / 55142 / 55296 / 55386 / 55387 / 55748 / 55772 / 55773 / 55774 / 55793 / 55794 / 55928 / 55930 / 55963 / 55968 / 55976 / 55993 / 56097 / 56100 / 56180 / 56184 / 56212 / 56213 / 56214 / 56229 / 56661 / 56666 / 57034 / 57039 / 57055 / 57056 / 57057 / 57076 / 57077 / 57490 / 57522 / 57529 / 57538 / 57541 / 57542 / 57543 / 57544 / 57567 / 57575 / 85645 / 85667 / 85939 / 85946 -
Model-based Web-Ranking >Extraction
2013 – 2014 / Center for Innovation and Technology (ZIT) -
Heterogenous Information Integration
2012 – 2017 / Austrian Science Fund (FWF)
Publications: 140863 / 147106 / 149494 / 151064 / 53423 / 54796 / 54797 / 54799 / 54843 / 54848 / 55397 / 55398 / 55399 / 55791 / 55901 / 55903 / 55976 / 56083 / 56094 / 56095 / 56096 / 56098 / 56099 / 56100 / 56102 / 56490 / 56541 / 56542 / 56544 / 56546 / 56547 / 56548 / 56550 / 56551 / 56661 / 56668 / 56671 / 56672 / 56673 / 56675 / 56676 / 56678 / 57034 / 57051 / 57055 / 57056 / 57057 / 57076 / 57077 / 57575 / 58807 / 58808 / 58809 / 58810 / 58811 / 58812 / 85949 / 86056 -
SEE: SPARQL Evaluation and Extensions
2012 – 2016 / Vienna Science and Technology Fund (WWTF)
Publications: 151027 / 151064 / 155646 / 155810 / 54884 / 54959 / 55042 / 55043 / 55095 / 55142 / 55338 / 55369 / 55386 / 55387 / 55399 / 55783 / 55784 / 55785 / 55787 / 55895 / 55896 / 55897 / 55901 / 55903 / 55928 / 55930 / 55963 / 55968 / 55993 / 56083 / 56094 / 56095 / 56096 / 56097 / 56098 / 56099 / 56100 / 56103 / 56402 / 56490 / 56541 / 56542 / 56544 / 56546 / 56547 / 56548 / 56550 / 56551 / 56661 / 58803 / 58807 / 58808 / 58809 / 58810 / 58811 / 58812 / 85949 / 86056 -
TASK MINING from CROWD BEHAVIOUR
2011 – 2013 / Austrian Research Promotion Agency (FFG)
Publications: 54861 / 55359 / 85225 -
Service-Oriented Data Integration
2009 – 2013 / Vienna Science and Technology Fund (WWTF)
Publications: 155421 / 155572 / 155674 / 155810 / 163519 / 163666 / 163815 / 166911 / 176218 / 52681 / 52725 / 52806 / 52812 / 53332 / 53335 / 53345 / 53444 / 53674 / 53675 / 53692 / 53702 / 53832 / 53891 / 53892 / 53894 / 54091 / 54149 / 54151 / 54169 / 54174 / 54585 / 54884 / 85030 / 85131 -
Advanced Barrier-free Browser Accessibility
2009 – 2011 / Austrian Research Promotion Agency (FFG)
Publications: 52815 / 52816 -
Theoretical Tractability vs. Practical Computation
2008 – 2012 / Austrian Science Fund (FWF)
Publications: 155421 / 155572 / 155810 / 163666 / 163667 / 167366 / 37126 / 52742 / 52743 / 52757 / 52759 / 52760 / 52762 / 52763 / 53134 / 53170 / 53671 / 53675 / 54154 / 54178 / 54179 / 54181 / 54202 / 54884 -
GraphWrap - Graph-Based Wrapping from PDF Documents
2008 – 2010 / Austrian Research Promotion Agency (FFG)
Publications: 52784 / 52785 / 52786 -
B1: A special-purpose meta-search generator for integrating deep web data
2007 – 2009 / Austrian Research Promotion Agency (FFG) -
Know it All and Know it Right: High Quality Mining in the Web
2005 – 2009 / Austrian Research Promotion Agency (FFG)
Publications: 50993 / 51040 / 51365 / 51531 -
NEXTWRAP Next Generation Web Wrapper Technologies
2005 – 2007 / Austrian Research Promotion Agency (FFG)
Publications: 51039 / 51140 / 51178 / 51366
Publications
2024
-
Fast parallel hypertree decompositions in logarithmic recursion depth
/
Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2024). Fast parallel hypertree decompositions in logarithmic recursion depth. ACM Transactions on Database Systems, 49(1), 1–43. https://doi.org/10.1145/3638758
Download: OA PDF (1.11 MB)
Projects: DeConquer (2023–2027) / HyperTrac (2018–2022) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
2023
-
Fractional covers of hypergraphs with bounded multi-intersection
/
Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science, 979, Article 114204. https://doi.org/10.1016/j.tcs.2023.114204
Download: Paper (460 KB)
Projects: DeConquer (2023–2027) / HyperTrac (2018–2022) -
SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog
/
Angles, R., Gottlob, G., Pavlović, A., Pichler, R., & Sallinger, E. (2023). SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog. Proceedings of the VLDB Endowment, 16(13), 4240–4253. https://doi.org/10.14778/3625054.3625061
Download: PDF (837 KB)
Projects: KnowledgeGraph (2020–2028) / SustainGraph (2023–2025) -
Convergence of datalog over (pre-)semirings
/
Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2023). Convergence of datalog over (pre-)semirings. SIGMOD RECORD, 52(1), 75–82. https://doi.org/10.1145/3604437.3604454
Project: DeConquer (2023–2027) -
Integration of Skyline Queries into Spark SQL
/
Grasmann, L., Pichler, R., & Selzer, A. (2023). Integration of Skyline Queries into Spark SQL. In F. Geerts & B. Vandevoort (Eds.), Proceedings 26th International Conference on Extending Database Technology (EDBT 2023) (pp. 337–350). OpenProceedings.org. https://doi.org/10.48786/edbt.2023.27
Download: PDF (1.98 MB)
Projects: HyperTrac (2018–2022) / KnowledgeGraph (2020–2028) -
Diversity of Answers to Conjunctive Queries
/
Merkl, T. C., Pichler, R., & Skritek, S. (2023). Diversity of Answers to Conjunctive Queries. In F. Geerts & B. Vandevoort (Eds.), 26th International Conference on Database Theory (pp. 10:1-10:19). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICDT.2023.10
Download: Paper (771 KB)
Project: HyperTrac (2018–2022) -
Diversity of Answers to Conjunctive Queries (extended Abstract)
/
Merkl, T. C., Pichler, R., & Skritek, S. (2023). Diversity of Answers to Conjunctive Queries (extended Abstract). In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). https://doi.org/10.34726/5393
Download: Paper (228 KB)
Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
2022
-
Fast and parallel decomposition of constraint satisfaction problems
/
Gottlob, G., Okulmus, C., & Pichler, R. (2022). Fast and parallel decomposition of constraint satisfaction problems. Constraints, 27, 284–326. https://doi.org/10.1007/s10601-022-09332-1
Project: HyperTrac (2018–2022) -
Optimizing Recursive Queries with Progam Synthesis
/
Wang, Y. R., Khamis, M. A., Ngo, H. Q., Pichler, R., & Suciu, D. (2022). Optimizing Recursive Queries with Progam Synthesis. In SIGMOD ’22: Proceedings of the 2022 International Conference on Management of Data (pp. 79–93). Association for Computing Machinery (ACM). https://doi.org/10.1145/3514221.3517827
Download: PDF (1.53 MB)
Project: HyperTrac (2018–2022) -
Convergence of Datalog over (Pre-) Semirings
/
Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2022). Convergence of Datalog over (Pre-) Semirings. In PODS ’22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (p. 105). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524140
Project: HyperTrac (2018–2022) -
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
/
Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2022). Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 325–336). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524153
Project: HyperTrac (2018–2022) -
Datalog in Wonderland
/
Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2022). Datalog in Wonderland. SIGMOD RECORD, 51(2), 6–17. https://doi.org/10.1145/3552490.3552492
Project: HyperTrac (2018–2022)
2021
-
Fast and Parallel Decomposition of Constraint Satisfaction Problems
/
Gottlob, G., Okulmus, C., & Pichler, R. (2021). Fast and Parallel Decomposition of Constraint Satisfaction Problems. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/161
Project: HyperTrac (2018–2022) -
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems
/
Chen, H., Gottlob, G., Lanzinger, M., & Pichler, R. (2021). Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/239
Project: HyperTrac (2018–2022) -
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
/
Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2021). HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. ACM Journal on Experimental Algorithmics, 26, 1–40. https://doi.org/10.1145/3440015
Project: HyperTrac (2018–2022)
2020
-
On the Language of Nested Tuple Generating Dependencies
/
Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2020). On the Language of Nested Tuple Generating Dependencies. ACM Transactions on Database Systems, 45(2), 1–59. https://doi.org/10.1145/3369554
Projects: HINT (2012–2017) / KnowledgeGraph (2020–2028) / START (2014–2022) - Enumerating the Repairs of Inconsistent Databases / Kimmelfeld, B., Pichler, R., Kolaitis, P. G., & Skritek, S. (2020). Enumerating the Repairs of Inconsistent Databases. WEPA 2020 - 4th International Workshop on Enumeration Problems and Applications, online, Haifa, Israel. http://hdl.handle.net/20.500.12708/87117
- Fractional Covers of Hypergraphs with BoundedMulti-Intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Fractional Covers of Hypergraphs with BoundedMulti-Intersection. In 45th International Symposium on Mathematical Foundations of Computer Science August 24-28, 2020, Prague (Czech Republic) (pp. 1–14). https://doi.org/10.4230/LIPIcs.MFCS.2020.41
- Complexity Analysis of General and Fractional Hypertree Decompositions / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Complexity Analysis of General and Fractional Hypertree Decompositions (p. 54). arXiv. https://doi.org/10.48550/arXiv.2002.05239
-
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
/
Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., & Pichler, R. (2020). The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 3–21). Springer. https://doi.org/10.1007/978-3-030-58942-4_1
Project: HyperTrac (2018–2022) - Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation / Pichler, R. (2020). Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. ACM SIGMOD Record, 49(1), 51–51. https://doi.org/10.1145/3422648.3422660
2019
-
Parallel Computation of Generalized Hypertree Decompositions
/
Gottlob, G., Pichler, R., & Okulmus, C. (2019). Parallel Computation of Generalized Hypertree Decompositions. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57860
Project: HyperTrac (2018–2022) -
HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings
/
Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2019). HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019.}, (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55517
Project: HyperTrac (2018–2022) -
Semantic Width Revisited (Extended Abstract)
/
Gottlob, G., Lanzinger, M., & Pichler, R. (2019). Semantic Width Revisited (Extended Abstract). In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55515
Project: HyperTrac (2018–2022) - Datalog: Bag Semantics via Set Semantics / Bertossi, L., Gottlob, G., & Pichler, R. (2019). Datalog: Bag Semantics via Set Semantics. In P. Barcelo & M. Calutti (Eds.), 22nd International Conference on Database Theory, {ICDT} 2019 (pp. 16:1-16:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2019.16
-
HyperBench
/
Fischl, W., Longo, D. M., Gottlob, G., & Pichler, R. (2019). HyperBench. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). ACM. https://doi.org/10.1145/3294052.3319683
Project: HyperTrac (2018–2022) - Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems / Lanzinger, M., Gottlob, G., & Pichler, R. (2019). Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems. In noch nicht bekannt (pp. 1–2). http://hdl.handle.net/20.500.12708/57793
-
A complexity theory for hard enumeration problems
/
Creignou, N., Kröll, M., Pichler, R., Skritek, S., & Vollmer, H. (2019). A complexity theory for hard enumeration problems. Discrete Applied Mathematics, 268, 191–209. https://doi.org/10.1016/j.dam.2019.02.025
Project: HyperTrac (2018–2022) - Enumeration in Data Management (Dagstuhl Seminar 19211) / Boros, E., Kimelfeld, B., Pichler, R., & Schweikardt, N. (2019). Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports, 9(5), 89–109. https://doi.org/10.4230/DagRep.9.5.89
2018
- Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection / Barceló, P., Kröll, M., Pichler, R., & Skritek, S. (2018). Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. ACM Transactions on Database Systems, 43(2), 1–44. https://doi.org/10.1145/3233983
- Advances in Database Technology — EDBT 2018 / Böhlen, M., Pichler, R., May, N., Rahm, E., Wu, S.-H., & Hose, K. (Eds.). (2018). Advances in Database Technology — EDBT 2018. EDBT 2018. https://doi.org/10.5441/002/edbt.2018.01
- Limits of Schema Mappings / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2018). Limits of Schema Mappings. Theory of Computing Systems, 62(4), 899–940. https://doi.org/10.1007/s00224-017-9812-7
- General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract) / Fischl, W., Gottlob, G., & Pichler, R. (2018). General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). In Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management (pp. 1–4). {CEUR} Workshop Proceedings. http://hdl.handle.net/20.500.12708/55500
-
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
/
Creignou, N., Pichler, R., & Woltran, S. (2018). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Logical Methods in Computer Science, 14(4), 1–25. https://doi.org/10.23638/LMCS-14(4:10)2018
Projects: FAIR (2013–2018) / START (2014–2022) -
General and Fractional Hypertree Decompositions: Hard and Easy Cases
/
Fischl, W., Gottlob, G., & Pichler, R. (2018). General and Fractional Hypertree Decompositions: Hard and Easy Cases. In Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems (pp. 17–32). ACM. https://doi.org/10.1145/3196959.3196962
Projects: FAIR (2013–2018) / HyperTrac (2018–2022) -
Computing the Schulze Method for Large-Scale Preference Data Sets
/
Csar, T., Lackner, M., & Pichler, R. (2018). Computing the Schulze Method for Large-Scale Preference Data Sets. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/25
Projects: FAIR (2013–2018) / HyperTrac (2018–2022) / START (2014–2022)
2017
-
Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458
/
Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458. In AAAI 2017 (pp. 451–458). http://hdl.handle.net/20.500.12708/57076
Projects: FAIR (2013–2018) / HINT (2012–2017) / START (2014–2022) -
Computational Social Choice in the Clouds
/
Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Computational Social Choice in the Clouds. In Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz “Datenbanksysteme für Business, Technologie und Web” (BTW) (pp. 163–167). http://hdl.handle.net/20.500.12708/57077
Projects: FAIR (2013–2018) / HINT (2012–2017) / START (2014–2022) -
Implementing Courcelle's Theorem in a declarative framework for dynamic programming
/
Bliem, B., Pichler, R., & Woltran, S. (2017). Implementing Courcelle’s Theorem in a declarative framework for dynamic programming. Journal of Logic and Computation, exv089. https://doi.org/10.1093/logcom/exv089
Projects: D-Flat (2013–2017) / FAIR (2013–2018) -
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability
/
Gottlob, G., Pichler, R., & Sallinger, E. (2017). Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. In E. Sallinger (Ed.), 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, AMW 2017 (pp. 1–5). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/57055
Projects: FAIR (2013–2018) / HINT (2012–2017) -
On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
/
Kröll, M., Pichler, R., & Woltran, S. (2017). On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/159
Projects: FAIR (2013–2018) / GRAPPA (2016–2019) / HINT (2012–2017) -
On the Complexity of Hard Enumeration Problems
/
Creignou, N., Kröll, M., Pichler, R., Skritek, S., & Vollmer, H. (2017). On the Complexity of Hard Enumeration Problems. In Language and Automata Theory and Applications - 11th International Conference, LATA 2017 (pp. 183–195). http://hdl.handle.net/20.500.12708/57056
Projects: FAIR (2013–2018) / HINT (2012–2017)
2016
-
Fuzzy data exchange
/
Medina, J., & Pichler, R. (2016). Fuzzy data exchange. Fuzzy Sets and Systems, 301, 129–145. https://doi.org/10.1016/j.fss.2015.12.004
Project: HINT (2012–2017) -
The Challenge of Optional Matching in SPARQL
/
Ahmetaj, S., Fischl, W., Kröll, M., Pichler, R., Šimkus, M., & Skritek, S. (2016). The Challenge of Optional Matching in SPARQL. In M. Gyssens & G. R. Simari (Eds.), Foundations of Information and Knowledge Systems 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings (pp. 169–190). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-30024-5_10
Projects: HINT (2012–2017) / SEE (2012–2016) -
Winner Determination in Huge Elections with MapReduce
/
Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2016). Winner Determination in Huge Elections with MapReduce. In M. Endres, N. Mattei, & A. Pfandler (Eds.), 10th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/56661
Projects: FAIR (2013–2018) / HINT (2012–2017) / SEE (2012–2016) / START (2014–2022) -
Complexity of Repair Checking and Consistent Query Answering
/
Arming, S., Pichler, R., & Sallinger, E. (2016). Complexity of Repair Checking and Consistent Query Answering. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 21:1-21:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.21
Projects: HINT (2012–2017) / SEE (2012–2016) -
Limits of Schema Mappings
/
Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2016). Limits of Schema Mappings. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 19:1-19:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.19
Projects: HINT (2012–2017) / SEE (2012–2016) -
On the Complexity of Enumerating the Answers to Well-designed Pattern Trees
/
Kröll, M., Pichler, R., & Skritek, S. (2016). On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 22:1-22:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.22
Projects: HINT (2012–2017) / SEE (2012–2016) -
A Datalog-Based Language for Querying RDF Graphs
/
Arenas, M., Gottlob, G., & Pieris, A. (2016). A Datalog-Based Language for Querying RDF Graphs. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56548
Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022) - Universities and computer science in the European crisis of refugees / Conrad, K., Musliu, N., Pichler, R., & Werthner, H. (2016). Universities and computer science in the European crisis of refugees. Communications of the ACM, 59(10), 31–33. https://doi.org/10.1145/2893180
-
Closed Predicates in Description Logics: Results on Combined Complexity
/
Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Closed Predicates in Description Logics: Results on Combined Complexity. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56672
Projects: HINT (2012–2017) / SemDat (2012–2016) -
Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates
/
Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56671
Projects: HINT (2012–2017) / SemDat (2012–2016) -
Semantic Acyclicity Under Constraints
/
Barceló, P., Gottlob, G., & Pieris, A. (2016). Semantic Acyclicity Under Constraints. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56547
Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022) -
On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees
/
Kröll, M., Pichler, R., & Skritek, S. (2016). On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56490
Projects: HINT (2012–2017) / SEE (2012–2016) - Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 / Pichler, R., & da Silva, A. S. (Eds.). (2016). Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016. CEUR-WS.org. http://hdl.handle.net/20.500.12708/24225
2015
-
The complexity of handling minimal solutions in logic-based abduction
/
Pfandler, A., Pichler, R., & Woltran, S. (2015). The complexity of handling minimal solutions in logic-based abduction. Journal of Logic and Computation, 25(3), 805–825. https://doi.org/10.1093/logcom/exu053
Project: FAIR (2013–2018) -
On the undecidability of the equivalence of second-order tuple generating dependencies
/
Feinerer, I., Pichler, R., Sallinger, E., & Savenkov, V. (2015). On the undecidability of the equivalence of second-order tuple generating dependencies. Information Systems, 48, 113–129. https://doi.org/10.1016/j.is.2014.09.003
Projects: HINT (2012–2017) / SEE (2012–2016) -
Function Symbols in Tuple-Generating Dependencies
/
Gottlob, G., Pichler, R., & Sallinger, E. (2015). Function Symbols in Tuple-Generating Dependencies. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745756
Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022) -
Towards Reconciling SPARQL and Certain Answers
/
Ahmetaj, S., Fischl, W., Pichler, R., Šimkus, M., & Skritek, S. (2015). Towards Reconciling SPARQL and Certain Answers. In A. Gangemi, L. Stefano, & A. Panconesi (Eds.), Proceedings of the 24th International Conference on World Wide Web. ACM. https://doi.org/10.1145/2736277.2741636
Projects: HINT (2012–2017) / SEE (2012–2016) -
Efficient Evaluation and Approximation of Well-designed Pattern Trees
/
Barcelo, P., Pichler, R., & Skritek, S. (2015). Efficient Evaluation and Approximation of Well-designed Pattern Trees. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745767
Projects: HINT (2012–2017) / SEE (2012–2016) -
Using Statistics for Computing Joins with MapReduce
/
Csar, T., Pichler, R., Sallinger, E., & Savenkov, V. (2015). Using Statistics for Computing Joins with MapReduce. In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56102
Projects: HINT (2012–2017) / START (2014–2022) -
Towards Reconciling SPARQL and Certain Answers (Extended Abstract)
/
Ahmetaj, S., Fischl, W., Pichler, R., Simkus, M., & Skritek, S. (2015). Towards Reconciling SPARQL and Certain Answers (Extended Abstract). In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56096
Projects: HINT (2012–2017) / SEE (2012–2016) -
Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract)
/
Barceló, P., Pichler, R., & Skritek, S. (2015). Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56095
Projects: HINT (2012–2017) / SEE (2012–2016) -
DL-Lite and Conjunctive Queries Extended by Optional Matching
/
Ahmetaj, S., Fischl, W., Pichler, R., Simkus, M., & Skritek, S. (2015). DL-Lite and Conjunctive Queries Extended by Optional Matching. In D. Calvanese & B. Konev (Eds.), Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56094
Projects: HINT (2012–2017) / SEE (2012–2016)
2014
- Belief revision within fragments of propositional logic / Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2014). Belief revision within fragments of propositional logic. Journal of Computer and System Sciences, 80(2), 427–449. https://doi.org/10.1016/j.jcss.2013.08.002
-
A Parameterized Complexity Analysis of Generalized CP-Nets
/
Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55773
Project: FAIR (2013–2018) -
Capturing Relational Schemas and Functional Dependencies in RDFS
/
Fischl, W., Calvanese, D., Pichler, R., Simkus, M., & Sallinger, E. (2014). Capturing Relational Schemas and Functional Dependencies in RDFS. Reasoning Web, International Summer School 2014, Athens, Greece. http://hdl.handle.net/20.500.12708/85949
Projects: HINT (2012–2017) / SEE (2012–2016) -
On the Parameterized Complexity of Generalized CP-Nets
/
Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). On the Parameterized Complexity of Generalized CP-Nets. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85939
Project: FAIR (2013–2018) - Nested dependencies: structure and reasoning / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2014). Nested dependencies: structure and reasoning. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS’14, Snowbird, UT, USA, June 22-27, 2014 (pp. 176–187). ACM. http://hdl.handle.net/20.500.12708/58804
-
Containment and equivalence of well-designed SPARQL
/
Pichler, R., & Skritek, S. (2014). Containment and equivalence of well-designed SPARQL. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM. https://doi.org/10.1145/2594538.2594542
Project: SEE (2012–2016) -
Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
/
Calvanese, D., Fischl, W., Pichler, R., Sallinger, E., & Simkus, M. (2014). Expressive Identification Constraints to Capture Functional Dependencies in Description Logics. In Informal Proceedings of the 27th International Workshop on Description Logics (DL 2014) (p. 5). CEUR-WS. http://hdl.handle.net/20.500.12708/55903
Projects: HINT (2012–2017) / SEE (2012–2016) -
Capturing Relational Schemas and Functional Dependencies in RDFS
/
Calvanese, D., Fischl, W., Pichler, R., Sallinger, E., & Simkus, M. (2014). Capturing Relational Schemas and Functional Dependencies in RDFS. In Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1003–1011). http://hdl.handle.net/20.500.12708/55901
Projects: HINT (2012–2017) / SEE (2012–2016) -
A Parameterized Complexity Analysis of Generalized CP-Nets
/
Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1091–1097). http://hdl.handle.net/20.500.12708/55793
Project: FAIR (2013–2018) -
Combined Complexity of Repair Checking and Consistent Query Answering
/
Arming, S., Pichler, R., & Sallinger, E. (2014). Combined Complexity of Repair Checking and Consistent Query Answering. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, Cartagena de Indias, Colombia, June 4-6, 2014 (p. 6). CEUR. http://hdl.handle.net/20.500.12708/55791
Project: HINT (2012–2017) -
On the Hardness of Counting the Solutions of SPARQL Queries
/
Pichler, R., & Skritek, S. (2014). On the Hardness of Counting the Solutions of SPARQL Queries. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management (p. 6). CEUR-WS. http://hdl.handle.net/20.500.12708/55783
Project: SEE (2012–2016) -
Certain Answers to Well-Designed SPARQL Queries
/
Pichler, R. (2014). Certain Answers to Well-Designed SPARQL Queries. In Dagstuhl Reports 4(8) (pp. 15–16). http://hdl.handle.net/20.500.12708/55369
Project: SEE (2012–2016)
2013
-
Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization
/
Gottlob, G., Lanzinger, M. P., Longo, D. M., Okulmus, C., Pichler, R., & Selzer, A. (2013). Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization. In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). CEUR-WS.org. https://doi.org/10.34726/5396
Download: PDF (932 KB)
Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025) -
Static Analysis and Optimization of Semantic Web Queries
/
Letelier, A., Pérez, J., Pichler, R., & Skritek, S. (2013). Static Analysis and Optimization of Semantic Web Queries. ACM Transactions on Database Systems, 38(4), 1–45. https://doi.org/10.1145/2500130
Projects: SEE (2012–2016) / SODI (2009–2013) / TTPC (2008–2012) -
Tractable counting of the answers to conjunctive queries
/
Pichler, R., & Skritek, S. (2013). Tractable counting of the answers to conjunctive queries. Journal of Computer and System Sciences, 79(6), 984–1001. https://doi.org/10.1016/j.jcss.2013.01.012
Projects: SODI (2009–2013) / TTPC (2008–2012) -
Relaxed Notions of Schema Mapping Equivalence Revisited
/
Pichler, R., Sallinger, E., & Savenkov, V. (2013). Relaxed Notions of Schema Mapping Equivalence Revisited. Theory of Computing Systems, 52(3), 483–541. https://doi.org/10.1007/s00224-012-9397-0
Project: SODI (2009–2013) -
A Parameterized Complexity Analysis of Generalized CP-Nets
/
Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2013). A Parameterized Complexity Analysis of Generalized CP-Nets. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/54788
Project: FAIR (2013–2018) -
Loop Elimination for Database Updates
/
Savenkov, V., Pichler, R., & Koch, C. (2013). Loop Elimination for Database Updates. In G. Gottlob, G. Grasso, D. Olteanu, & C. Schallhart (Eds.), Big Data (pp. 48–61). Springer. https://doi.org/10.1007/978-3-642-39467-6_8
Project: HINT (2012–2017) -
Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries
/
Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2013). Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web: Interoperability, Usability, Applicability, 4(4), 351–393. http://hdl.handle.net/20.500.12708/155572
Projects: SODI (2009–2013) / TTPC (2008–2012) - Coping with High Complexity: Structure Matters / Pichler, R. (2013). Coping with High Complexity: Structure Matters. The 32nd INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SOCIETY (SCCC), Temuco, Non-EU. http://hdl.handle.net/20.500.12708/85923
-
Applicability of ASP-based Problem Solving on Tree Decompositions
/
Bliem, B., Pichler, R., & Woltran, S. (2013). Applicability of ASP-based Problem Solving on Tree Decompositions. Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR) 2013, Peking, Non-EU. http://hdl.handle.net/20.500.12708/85667
Projects: D-Flat (2013–2017) / FAIR (2013–2018) -
Enhancing the Updatability of Projective Views
/
Guagliardo, P., Pichler, R., & Sallinger, E. (2013). Enhancing the Updatability of Projective Views. In Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management (p. 7). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/54848
Project: HINT (2012–2017) -
Efficient Updates of Uncertain Databases
/
Hubmer, A., Pichler, R., Savenkov, V., & Skritek, S. (2013). Efficient Updates of Uncertain Databases. In L. Bravo & M. Lenzerini (Eds.), Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management Puebla/Cholula, Mexico, May 21-23, 2013 (p. 7). CEUR-WS. http://hdl.handle.net/20.500.12708/54797
Project: HINT (2012–2017) -
Conformant Planning as a Benchmark for QBF-Solvers
/
Kronegger, M., Pfandler, A., & Pichler, R. (2013). Conformant Planning as a Benchmark for QBF-Solvers. In International Workshop on Quantified Boolean Formulas (QBF 2013) (p. 5). http://hdl.handle.net/20.500.12708/54793
Project: FAIR (2013–2018) -
Parameterized Complexity of Optimal Planning: A Detailed Map
/
Kronegger, M., Pfandler, A., & Pichler, R. (2013). Parameterized Complexity of Optimal Planning: A Detailed Map. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54787
Project: FAIR (2013–2018) -
Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem
/
Bliem, B., Pichler, R., & Woltran, S. (2013). Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation (pp. 28–40). Springer. https://doi.org/10.1007/978-3-319-03898-8_4
Project: D-Flat (2013–2017) -
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
/
Creignou, N., Pichler, R., & Woltran, S. (2013). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? In F. Rossi (Ed.), Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54860
Project: FAIR (2013–2018)
2012
-
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
/
PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099
Project: Complex Reason (2010–2014) -
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
/
Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR - Computing Research Repository. https://doi.org/10.48550/arXiv.1204.3040
Project: TTPC (2008–2012) - Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2012). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. In Y. Hamadi & M. Schoenauer (Eds.), Learning and Intelligent Optimization (pp. 130–144). Springer. https://doi.org/10.1007/978-3-642-34413-8_10
-
Quality-aware Service-Oriented Data Integration: Requirements, State of the Art and Open Challenges
/
Dustdar, S., Pichler, R., Savenkov, V., & Truong, H.-L. (2012). Quality-aware Service-Oriented Data Integration: Requirements, State of the Art and Open Challenges. ACM SIGMOD Record, 41(1), 11–19. http://hdl.handle.net/20.500.12708/163519
Project: SODI (2009–2013) -
Towards fixed-parameter tractable algorithms for abstract argumentation
/
Dvořák, W., Pichler, R., & Woltran, S. (2012). Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence, 186, 1–37. https://doi.org/10.1016/j.artint.2012.03.005
Projects: Argu (2009–2012) / SODI (2009–2013) / TTPC (2008–2012) -
Incorporating Data Concerns into Query Languages for Data Services
/
Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2012). Incorporating Data Concerns into Query Languages for Data Services. In R. Zhang, J. Zhang, Z. Zhang, J. Filipe, & J. Cordeiro (Eds.), Enterprise Information Systems (pp. 132–145). Springer. https://doi.org/10.1007/978-3-642-29958-2_9
Project: SODI (2009–2013) - SPAM: A SPARQL Analysis and Manipulation Tool / Letelier, A., Perez, J., Pichler, R., & Skritek, S. (2012). SPAM: A SPARQL Analysis and Manipulation Tool. In Z. M. Özsoyoglu (Ed.), Proceedings of the VLDB (pp. 1958–1961). http://hdl.handle.net/20.500.12708/54495
-
Multicut on Graphs of Bounded Clique-Width
/
Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Combinatorial Optimization and Applications (pp. 115–126). Springer. https://doi.org/10.1007/978-3-642-31770-5_11
Project: TTPC (2008–2012) -
Belief Revision within Fragments of Propositional Logic
/
Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2012). Belief Revision within Fragments of Propositional Logic. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54154
Project: TTPC (2008–2012) -
Static analysis and optimization of semantic web queries
/
Letelier, A., Pérez, J., Pichler, R., & Skritek, S. (2012). Static analysis and optimization of semantic web queries. In M. Benedikt, M. Krötzsch, & M. Lenzerini (Eds.), Proceedings of the 31st symposium on Principles of Database Systems - PODS ’12. ACM. https://doi.org/10.1145/2213556.2213572
Project: SODI (2009–2013) -
Union and Intersection of Schema Mappings
/
Perez, J., Pichler, R., Sallinger, E., & Savenkov, V. (2012). Union and Intersection of Schema Mappings. In J. Freire & D. Suciu (Eds.), Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management (p. 13). CEUR-WS.org. http://hdl.handle.net/20.500.12708/54149
Project: SODI (2009–2013)
2011
-
Tractable Counting of the Answers to Conjunctive Queries
/
Pichler, R., & Skritek, S. (2011). Tractable Counting of the Answers to Conjunctive Queries. In P. Barceló & V. Tannen (Eds.), Alberto Mendelzon International Workshop on Foundations of Data Management 2011 (p. 12). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/53692
Project: SODI (2009–2013) - On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies / Feinerer, I., Pichler, R., Sallinger, E., & Savenkov, V. (2011). On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies. In P. Barceló & V. Tannen (Eds.), Alberto Mendelzon International Workshop on Foundations of Data Management 2011 (p. 13). http://hdl.handle.net/20.500.12708/53693
- A New Tree-Decomposition Based Algorithm for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). A New Tree-Decomposition Based Algorithm for Answer Set Programming. In T. M. Khoshgoftaar & X. Zhu (Eds.), 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence. https://doi.org/10.1109/ictai.2011.154
- Normalization and optimization of schema mappings / Gottlob, G., Pichler, R., & Savenkov, V. (2011). Normalization and optimization of schema mappings. The VLDB Journal. https://doi.org/10.1007/s00778-011-0226-x
- On Integrating Data Services Using Data Mashups / Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2011). On Integrating Data Services Using Data Mashups. In A. A. A. Fernandes, A. J. G. Gray, & K. Belhajjame (Eds.), Advances in Databases: 28th British National Conference on Databases, BNCOD 28 (pp. 132–135). LNCS/Springer. https://doi.org/10.1007/978-3-642-24577-0_14
-
Data Concern Aware Querying for the Integration of Data Services
/
Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2011). Data Concern Aware Querying for the Integration of Data Services. In J. Cordeiro, X. Li, Z. Zhang, & J. Zhang (Eds.), Proceedings of the 13#^{th} International Conference on Enterprise Information Systems (pp. 111–119). SciTePress. http://hdl.handle.net/20.500.12708/53892
Project: SODI (2009–2013) -
The Complexity of Evaluating Tuple Generating Dependencies
/
Pichler, R., & Skritek, S. (2011). The Complexity of Evaluating Tuple Generating Dependencies. In T. Milo (Ed.), Proceedings of the 14#^{th} International Conference on Database Theory (p. 12). ACM. http://hdl.handle.net/20.500.12708/53675
Projects: SODI (2009–2013) / TTPC (2008–2012) -
Relaxed Notions of Schema Mapping Equivalence Revisited
/
Pichler, R., Sallinger, E., & Savenkov, V. (2011). Relaxed Notions of Schema Mapping Equivalence Revisited. In T. Milo (Ed.), Proceedings of the 14th International Conference Database Theory (p. 12). ACM. http://hdl.handle.net/20.500.12708/53674
Project: SODI (2009–2013) - Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming (DBAI-TR-2011-73). http://hdl.handle.net/20.500.12708/37104
-
Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation
/
Dvorak, W., Pichler, R., & Woltran, S. (2011). Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation (DBAI-TR-2011-74). http://hdl.handle.net/20.500.12708/37126
Projects: Argu (2009–2012) / TTPC (2008–2012)
2010
-
Multicut Algorithms via Tree Decompositions
/
Pichler, R., Rümmele, S., & Woltran, S. (2010). Multicut Algorithms via Tree Decompositions. In T. Calamoneri & J. Diaz (Eds.), Algorithms and Complexity : 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings (pp. 167–179). LNCS, Springer. https://doi.org/10.1007/978-3-642-13073-1_16
Projects: Argu (2009–2012) / TTPC (2008–2012) - Counting complexity of propositional abduction / Hermann, M., & Pichler, R. (2010). Counting complexity of propositional abduction. Journal of Computer and System Sciences, 76(7), 634–649. https://doi.org/10.1016/j.jcss.2009.12.001
- Towards practical feasibility of core computation in data exchange / Pichler, R., & Savenkov, V. (2010). Towards practical feasibility of core computation in data exchange. Theoretical Computer Science, 411(7–9), 935–957. https://doi.org/10.1016/j.tcs.2009.09.035
- Bounded treewidth as a key to tractability of knowledge representation and reasoning / Gottlob, G., Pichler, R., & Wei, F. (2010). Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artificial Intelligence, 174(1), 105–132. https://doi.org/10.1016/j.artint.2009.10.003
- Tractable database design and datalog abduction through bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Tractable database design and datalog abduction through bounded treewidth. Information Systems, 35(3), 278–298. https://doi.org/10.1016/j.is.2009.09.003
- Monadic datalog over finite structures of bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Monadic datalog over finite structures of bounded treewidth. ACM Transactions on Computational Logic, 12(1), 1–48. https://doi.org/10.1145/1838552.1838555
- Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries / Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. In P. Hitzler & T. Lukasiewicz (Eds.), Web Reasoning and Rule Systems (pp. 133–148). Lecture Notes/ Springer. https://doi.org/10.1007/978-3-642-15918-3_11
- Minimising RDF Graphs under Rules and Constraints Revisited / Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Minimising RDF Graphs under Rules and Constraints Revisited. In A. H. F. Laender & L. V. S. Lakshmanan (Eds.), Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/53438
- Uncertain Databases in Collaborative Data Management / Pichler, R., Savenkov, V., Skritek, S., & Truong, H.-L. (2010). Uncertain Databases in Collaborative Data Management. In A. de Keijzer & M. van Keulen (Eds.), CTIT Workshop Proceedings Series (pp. 129–143). CTIT, Centre for Telematics and Information Technology. http://hdl.handle.net/20.500.12708/53505
- The Complexity of Handling Minimal Solutions in Logic-Based Abduction / Pichler, R., & Woltran, S. (2010). The Complexity of Handling Minimal Solutions in Logic-Based Abduction. In H. Coelho, R. Studer, & M. Woolridge (Eds.), Prooceedings of ECAI 2010 - 19th European Conference on Artificial Intelligence (pp. 895–900). IOS Press. http://hdl.handle.net/20.500.12708/53439
- A Dynamic-Programming Based ASP-Solver / Morak, M., Pichler, R., Rümmele, S., & Woltran, S. (2010). A Dynamic-Programming Based ASP-Solver. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logics in Artificial Intelligence (pp. 369–372). Springer. https://doi.org/10.1007/978-3-642-15675-5_34
- Counting and Enumeration Problems with Bounded Treewidth / Pichler, R., Rümmele, S., & Woltran, S. (2010). Counting and Enumeration Problems with Bounded Treewidth. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 387–404). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-17511-4_22
-
Schema Mapping Optimization in the Presence of Target Constraints
/
Sallinger, E., Pichler, R., & Savenkov, V. (2010). Schema Mapping Optimization in the Presence of Target Constraints. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 309–310). http://hdl.handle.net/20.500.12708/53423
Project: HINT (2012–2017) - Decentralized Diagnosis: Complexity Analysis and Datalog Encodings / Pfandler, A., Pichler, R., & Woltran, S. (2010). Decentralized Diagnosis: Complexity Analysis and Datalog Encodings. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 291–292). http://hdl.handle.net/20.500.12708/53424
- Implementing a Peer Database Management System / Skritek, S., & Pichler, R. (2010). Implementing a Peer Database Management System. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 299–300). http://hdl.handle.net/20.500.12708/53422
-
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
/
Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2010). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53171
Projects: Argu (2009–2012) / Complex Reason (2010–2014) -
Towards Fixed-Parameter Tractable Algorithms for Argumentation
/
Dvorak, W., Pichler, R., & Woltran, S. (2010). Towards Fixed-Parameter Tractable Algorithms for Argumentation. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53170
Projects: Argu (2009–2012) / TTPC (2008–2012)
2009
- Complexity of Counting the Optimal Solution / Hermann, M., & Pichler, R. (2009). Complexity of Counting the Optimal Solution. Theoretical Computer Science, 410(38–40), 3814–3825. http://hdl.handle.net/20.500.12708/166542
-
Belief Revision with Bounded Treewidth
/
Pichler, R., Rümmele, S., & Woltran, S. (2009). Belief Revision with Bounded Treewidth. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 250–263). Springer. https://doi.org/10.1007/978-3-642-04238-6_22
Project: TTPC (2008–2012) -
On Using Distributed Extended XQuery for Web Data Sources as Services
/
Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2009). On Using Distributed Extended XQuery for Web Data Sources as Services. In M. Gaedke, M. Grossniklaus, & O. Díaz (Eds.), Web Engineering, 9th International Conference, ICWE 2009 San Sebastián, Spain, June 24-26 2009 Proceedings (pp. 497–500). Springer. https://doi.org/10.1007/978-3-642-02818-2_47
Project: SODI (2009–2013) -
Alternation as a programming paradigm
/
Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419
Project: TTPC (2008–2012) -
DEMo: Data Exchange Modeling Tool
/
Pichler, R., & Savenkov, V. (2009). DEMo: Data Exchange Modeling Tool. In H. V. Jagadish (Ed.), Proceedings of the 35#^{th}Int. Conf. on Very Large Data Bases (p. 4). http://hdl.handle.net/20.500.12708/52812
Project: SODI (2009–2013) -
Normalization and Optimization of Schema Mappings
/
Gottlob, G., Pichler, R., & Savenkov, V. (2009). Normalization and Optimization of Schema Mappings. In H. V. Jagadish (Ed.), Proceedings of the 35#^{th}Int. Conf. on Very Large Data Bases (p. 12). VLDB Endowment. http://hdl.handle.net/20.500.12708/52806
Project: SODI (2009–2013) -
Answer-Set Programming with Bounded Tree Width
/
Jakl, M., Pichler, R., & Woltran, S. (2009). Answer-Set Programming with Bounded Tree Width. In C. Boutilier (Ed.), Proc. of the Twenty-First Int. Joint Conference on Artificial Intelligence (pp. 816–822). AAAI Press. http://hdl.handle.net/20.500.12708/52743
Project: TTPC (2008–2012) -
DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources
/
Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2009). DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources. In J. Filipe & J. Cordeiro (Eds.), Enterprise Information Systems Proceedings of the 11th International Conference, ICEIS 2009 (pp. 172–183). Springer. http://hdl.handle.net/20.500.12708/52681
Project: SODI (2009–2013) - Alternation as a Programming Paradigm / Dvorak, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a Programming Paradigm (DBAI-TR-2009-64). http://hdl.handle.net/20.500.12708/35631
2008
- dRDF: Entailment for Domain-Restricted RDF / Pichler, R., Polleres, A., Wei, F., & Woltran, S. (2008). dRDF: Entailment for Domain-Restricted RDF. In The Semantic Web: Research and Applications (pp. 200–214). Springer LNCS. https://doi.org/10.1007/978-3-540-68234-9_17
- Towards Practical Feasibility of Core Computation in Data Exchange / Savenkov, V., & Pichler, R. (2008). Towards Practical Feasibility of Core Computation in Data Exchange. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 62–78). Springer. http://hdl.handle.net/20.500.12708/52365
- Fast Counting with Bounded Treewidth / Jakl, M., Pichler, R., Rümmele, S., & Woltran, S. (2008). Fast Counting with Bounded Treewidth. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 436–450). Springer. http://hdl.handle.net/20.500.12708/52425
- Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation / Gottlob, G., Pichler, R., & Wei, F. (2008). Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. In A. Cohn & D. M. Hamilton (Eds.), AAAI-08/IAAI-08 Proceedings (pp. 1541–1547). AAAI Press. http://hdl.handle.net/20.500.12708/52641
- dRDF: Entailment for Domain-Restricted RDF / Pichler, R., Polleres, A., Wei, F., & Woltran, S. (2008). dRDF: Entailment for Domain-Restricted RDF (DBAI-TR-2008-59). http://hdl.handle.net/20.500.12708/35162
- Complexity of Counting the Optimal Solutions / Hermann, M., & Pichler, R. (2008). Complexity of Counting the Optimal Solutions. In X. Hu & J. Wang (Eds.), Computing and Combinatorics: 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings (pp. 149–159). Lecture Notes of Computer Science, Springer. https://doi.org/10.1007/978-3-540-69733-6_16
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction / Herman, M., & Pichler, R. (2008). Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. In S. Hölldobler, C. Lutz, & H. Wansing (Eds.), Logics in Artificial Intelligence (pp. 206–218). http://hdl.handle.net/20.500.12708/52292
- Fast Counting with Bounded Treewidth / Jakl, M., Pichler, R., Rümmele, S., & Woltran, S. (2008). Fast Counting with Bounded Treewidth (DBAI-TR-2008-61). http://hdl.handle.net/20.500.12708/35325
2007
- Model Representation over Finite and Infinite Signatures / Fermüller, C., & Pichler, R. (2007). Model Representation over Finite and Infinite Signatures. Journal of Logic and Computation, 17(3), 453–477. https://doi.org/10.1093/logcom/exm008
- Efficient Datalog Abduction through Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2007). Efficient Datalog Abduction through Bounded Treewidth. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/51837
- Foundations of Rule-Based Query / Bry, F., Eisinger, N., Eiter, T., Furche, T., Gottlob, G., Ley, C., Linse, B., Pichler, R., & Wei, F. (2007). Foundations of Rule-Based Query. In Reasoning Web (pp. 1–153). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/51850
- Monadic Datalog over Finite Structures with Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2007). Monadic Datalog over Finite Structures with Bounded Treewidth. In P. G. Kolaitis (Ed.), Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART -Symposium on Principles of Database Systems (PODS 2007) (pp. 165–174). ACM. http://hdl.handle.net/20.500.12708/51822
- Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains / Fink, M., Pichler, R., Tompits, H., & Woltran, S. (2007). Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains. In C. Baral, G. Brewka, & J. Schlipf (Eds.), Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007) (pp. 123–135). Springer. http://hdl.handle.net/20.500.12708/51780
- Counting Complexity of Propositional Abduction / Hermann, M., & Pichler, R. (2007). Counting Complexity of Propositional Abduction. In Proceeding of the Twentieth International Joint Conference on Artificial Intelligence (pp. 417–422). AAAI Press. http://hdl.handle.net/20.500.12708/51772
2006
- Algorithmic Aspectc of Model Representations / Pichler, R. (2006). Algorithmic Aspectc of Model Representations. In M. Fink, H. Tompits, & S. Woltran (Eds.), 20th Workshop on Logic Programming (WLP2006) (pp. 12–20). INFSYS Research Report. http://hdl.handle.net/20.500.12708/51472
- Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning / Gottlob, G., Pichler, R., & Wei, F. (2006). Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In Proceeding of the Twenty-First National Conference on Artificial Intelligence (pp. 250–256). The AAAI Press. http://hdl.handle.net/20.500.12708/51474
- Model Representation via Contexts and Implicit Generalizations / Fermüller, C., & Pichler, R. (2006). Model Representation via Contexts and Implicit Generalizations. In Logics in Artificial Intelligence (LNAI) (pp. 164–176). Springer-Verlag. http://hdl.handle.net/20.500.12708/51419
- Tractable Database Design through Bounded Treewidth / Gottlob, G., Pichler, R., & Wei, F. (2006). Tractable Database Design through Bounded Treewidth. In Proceedings of the Twenty-Fifth ACM SIGMOND-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 124–133). ACM Press. http://hdl.handle.net/20.500.12708/51363
2005
- On Deciding Subsumption Problems / Egly, U., Pichler, R., & Woltran, S. (2005). On Deciding Subsumption Problems. Annals of Mathematics and Artificial Intelligence, 43(1–4), 255–294. http://hdl.handle.net/20.500.12708/173345
- Model Representation via Contexts and Implicit Generalizations / Fermüller, C., & Pichler, R. (2005). Model Representation via Contexts and Implicit Generalizations. In Automated Deduction - CADE-20 (pp. 409–423). Springer Science + Business Media. http://hdl.handle.net/20.500.12708/51026
2003
- On Deciding Subsumption Problems / Egly, U., Pichler, R., & Woltran, S. (2003). On Deciding Subsumption Problems. http://hdl.handle.net/20.500.12708/32928
Supervisions
2024
-
Structure-Guided Query Optimization in Column-Stores
/
Aichinger, J. (2024). Structure-Guided Query Optimization in Column-Stores [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.113980
Download: PDF (2.5 MB) -
Comparative Analysis of Retrieval Augmented Generator and Traditional Large Language Models
/
Oroz, T. (2024). Comparative Analysis of Retrieval Augmented Generator and Traditional Large Language Models [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.118825
Download: PDF (1.59 MB) -
To rewrite or not to rewrite: Decision making in query optimization of SQL queries
/
Böhm, D. (2024). To rewrite or not to rewrite: Decision making in query optimization of SQL queries [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.120310
Download: PDF (2.63 MB) -
Comparison of RDF triplestores in a Kubernetes environment
/
Bretterbauer, M. (2024). Comparison of RDF triplestores in a Kubernetes environment [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.87104
Download: PDF (1.68 MB) -
Turning FPT decision methods into enumeration algorithms with FPT-delay
/
Unterberger, D. (2024). Turning FPT decision methods into enumeration algorithms with FPT-delay [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.119942
Download: PDF (847 KB)
2023
-
Integration of structure guided query optimization into newSQL databases
/
Martinek, M. (2023). Integration of structure guided query optimization into newSQL databases [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.112344
Download: PDF (1.94 MB) -
Score-based explanations of classification outcomes and answers to database queries
/
Lackner, F. (2023). Score-based explanations of classification outcomes and answers to database queries [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.105800
Download: PDF (2.05 MB) -
Improving joins in pandas
/
Steindl, A. (2023). Improving joins in pandas [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.109101
Download: PDF (1.17 MB)
2022
-
Parallel Computation of Structural Decompositions
/
Okulmus, C. (2022). Parallel Computation of Structural Decompositions [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108704
Download: PDF (1.54 MB) -
Generating diverse solutions to conjunctive queries and propositional formulae
/
Merkl, T. C. (2022). Generating diverse solutions to conjunctive queries and propositional formulae [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.102520
Download: PDF (1 MB) -
Integrating skyline queries into spark SQL : Efficient and productive integration of skyline queries into apache spark SQL
/
Grasmann, L. (2022). Integrating skyline queries into spark SQL : Efficient and productive integration of skyline queries into apache spark SQL [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.89283
Download: PDF (1.9 MB) - Performance Analysis of Column-Store Extensions for Modern-Day Business Segments / Sessa, V. (2022). Performance Analysis of Column-Store Extensions for Modern-Day Business Segments [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158484
2021
-
Lightweight integration of query decomposition techniques into SQL-based database systems
/
Selzer, A. (2021). Lightweight integration of query decomposition techniques into SQL-based database systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.81940
Download: PDF (1.51 MB) -
Integration of worst-case optimal join algorithms into column-stores
/
Ledl, M. (2021). Integration of worst-case optimal join algorithms into column-stores [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.89722
Download: PDF (1.77 MB) -
Analyse und Vergleich von gängigen Graph-Anfragesprachen
/
Klampfer, M. (2021). Analyse und Vergleich von gängigen Graph-Anfragesprachen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.79353
Download: PDF (2.33 MB)
2020
-
Hypergraph invariants for computational complexity
/
Lanzinger, M. P. (2020). Hypergraph invariants for computational complexity [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90042
Download: PDF (2.17 MB) - Reasoning in knowledge graphs : bridging databases and the semantic web / Pavlović, A. (2020). Reasoning in knowledge graphs : bridging databases and the semantic web [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79741
2018
-
Generalized and fractional hypertree decompositions : from theory to practice
/
Fischl, W. (2018). Generalized and fractional hypertree decompositions : from theory to practice [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.62943
Download: PDF (3.25 MB) -
In-depth evaluation of NoSQL and NewSQL database management systems
/
Heinzl, M. (2018). In-depth evaluation of NoSQL and NewSQL database management systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.52260
Download: PDF (1.76 MB) -
Cloud computing techniques for winner determination in computational social choice
/
Csar, J. T. (2018). Cloud computing techniques for winner determination in computational social choice [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.58041
Download: PDF (1.12 MB) - Parameterized algorithms for maximum-weight matching / Scharinger, A. (2018). Parameterized algorithms for maximum-weight matching [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78199
2017
-
A modular portfolio solver for planning
/
Benuska, V. (2017). A modular portfolio solver for planning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.27685
Download: PDF (2.65 MB) -
Distributed big data frameworks
/
Becker, M. (2017). Distributed big data frameworks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.43462
Download: PDF (1.49 MB)
2016
-
Complexity of well-designed SPARQL
/
Svozil, A. (2016). Complexity of well-designed SPARQL [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.37350
Download: PDF (881 KB) -
Query answering through reformulation
/
Chen, Y. (2016). Query answering through reformulation [Master Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.30547
Download: PDF (517 KB) - On the parameterized complexity of planning / Kronegger, M. (2016). On the parameterized complexity of planning [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79793
2015
-
A universal layer for schema mapping languages
/
Chertes, F. I. (2015). A universal layer for schema mapping languages [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.31180
Download: PDF (1.44 MB) -
Solving data quality problems in data warehousing by means of data exchange techniques
/
Jozaf, J. (2015). Solving data quality problems in data warehousing by means of data exchange techniques [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.28969
Download: PDF (922 KB) - Complexity of repair checking and consistent query answering / Arming, S. (2015). Complexity of repair checking and consistent query answering [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79156
- Teaching and learning foundations of computer science : on the unusual effectiveness of logic in computer science / Sallinger, E. (2015). Teaching and learning foundations of computer science : on the unusual effectiveness of logic in computer science [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/78357
2014
-
Detecting structure in permutations and preferences
/
Lackner, M. (2014). Detecting structure in permutations and preferences [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24943
Download: PDF (1.08 MB) -
XML data integration
/
Stoilkovska, I. (2014). XML data integration [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.25224
Download: PDF (767 KB) - Foundations of information integration : analyzing, managing and reasoning about schema mappings / Sallinger, E. (2014). Foundations of information integration : analyzing, managing and reasoning about schema mappings [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79436
2013
-
Case studies, automatic reporting, evaluation and optimization of usability using Advanced User Behaviour Analysis
/
Neukam, D. (2013). Case studies, automatic reporting, evaluation and optimization of usability using Advanced User Behaviour Analysis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21678
Download: PDF (2.9 MB) -
Machine learning algorithms for visual pattern detection on web pages
/
Kordomatis, I. G. (2013). Machine learning algorithms for visual pattern detection on web pages [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-66654
Download: PDF (3.65 MB) -
Repackaging web pages using Advanced User Behaviour Analysis
/
Aster, M. (2013). Repackaging web pages using Advanced User Behaviour Analysis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21672
Download: PDF (18 MB) -
Web accessibility for the blind through visual representation analysis
/
Fayzrakhmanov, R. (2013). Web accessibility for the blind through visual representation analysis [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.23297
Download: PDF (7.71 MB) -
Data exchange of relational data and beyond
/
Maschler, J. (2013). Data exchange of relational data and beyond [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22410
Download: PDF (638 KB) -
Normal forms for non-relational data
/
Fischl, W. (2013). Normal forms for non-relational data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22408
Download: PDF (905 KB) -
Web interaction archiving and replay using Advanced User Behaviour Analysis
/
Morgenbesser, S. (2013). Web interaction archiving and replay using Advanced User Behaviour Analysis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21673
Download: PDF (18.3 MB) - Foundational aspects of Semantic Web optimization : new algorithms and complexity results / Skritek, S. (2013). Foundational aspects of Semantic Web optimization : new algorithms and complexity results [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159695
2012
-
Foundational aspects of schema mapping optimization and normalization
/
Savenkov, V. (2012). Foundational aspects of schema mapping optimization and normalization [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-47546
Download: PDF (1.07 MB) -
Constructing a knowledge base for business process management
/
Kim, T. T. T. (2012). Constructing a knowledge base for business process management [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-57421
Download: PDF (9.21 MB) -
The parameterized complexity of nonmonotonic reasoning
/
Rümmele, S. (2012). The parameterized complexity of nonmonotonic reasoning [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-56578
Download: PDF (665 KB)
2011
-
Distributed heterogeneous web data sources integration DeXIN approach
/
Ali, M. I. (2011). Distributed heterogeneous web data sources integration DeXIN approach [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-43038
Download: PDF (1.97 MB) -
New representations of uncertain databases for efficient updates
/
Hubmer, A. (2011). New representations of uncertain databases for efficient updates [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-40663
Download: PDF (892 KB) - Efficient planning with QBF-solvers / Kronegger, M. (2011). Efficient planning with QBF-solvers [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160797
2010
-
Fixed parameter algorithms for answer set programming
/
Jakl, M. (2010). Fixed parameter algorithms for answer set programming [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-35766
Download: PDF (818 KB) -
Complexity results and algorithms for Multicut on graphs of bounded clique-width
/
Lackner, M. (2010). Complexity results and algorithms for Multicut on graphs of bounded clique-width [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-44603
Download: PDF (509 KB) - Optimizing schema mappings with relaxed notions of equivalence / Sallinger, E. (2010). Optimizing schema mappings with relaxed notions of equivalence [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161530
- Collecting online data anonymously : de-personalisation and security barriers on the Web / Schmid, A. (2010). Collecting online data anonymously : de-personalisation and security barriers on the Web [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161403
- The foundations of data integration / Rettinger, S. (2010). The foundations of data integration [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159793
- Efficient evaluation of conjunctive queries / Zalcmanis, M. (2010). Efficient evaluation of conjunctive queries [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159775
2009
-
Implementing a Peer Data Management System
/
Skritek, S. (2009). Implementing a Peer Data Management System [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36716
Download: PDF (1.15 MB) -
On extending postgreSQL with the skyline operator
/
Eder, J. (2009). On extending postgreSQL with the skyline operator [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-29128
Download: PDF (1.28 MB) -
Analyse von Redundanzen beim Datenaustausch
/
Wagner, F. (2009). Analyse von Redundanzen beim Datenaustausch [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-33640
Download: PDF (643 KB) - Complexity of argumentation / Roubíčková, A. (2009). Complexity of argumentation [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186623
- Decentralized diagnosis: complexity analysis and Datalog encodings / Pfandler, A. T. (2009). Decentralized diagnosis: complexity analysis and Datalog encodings [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186621
- Realizing Web accessibility based on understanding the visual structure of grocery Web portals / Prangnawarat, N. (2009). Realizing Web accessibility based on understanding the visual structure of grocery Web portals [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186098
- Planning and designing an end user portal for workflow based web data extraction applications / Satz, H. (2009). Planning and designing an end user portal for workflow based web data extraction applications [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183404
- OpenESB for Web Process Integration / Selinger, O. (2009). OpenESB for Web Process Integration [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/177885
- Wrapper adaptation and generic wrappers / Chandradoss, R. J. (2009). Wrapper adaptation and generic wrappers [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/177810
2008
-
An application of heuristic route search techniques for a scalable flight search system
/
Darmaputra, Y. (2008). An application of heuristic route search techniques for a scalable flight search system [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-27335
Download: PDF (2.26 MB) -
Umsetzung einer e-Learning Applikation für SQL mithilfe eines regelbasierten Bewertungssystems
/
Gansterer, P. (2008). Umsetzung einer e-Learning Applikation für SQL mithilfe eines regelbasierten Bewertungssystems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-27391
Download: PDF (6.61 MB) -
A free online Web Accessibility Evaluation Tool
/
Egger, J. (2008). A free online Web Accessibility Evaluation Tool [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-20387
Download: PDF (3.35 MB) -
Optimizations of structural join algorithms
/
Dorner, M. (2008). Optimizations of structural join algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-23766
Download: PDF (1.7 MB) -
Automatisiertes Verständnis von formularbasierten Webseiten durch statistische Klassifikation der Seiten und Elemente
/
Mager, A. (2008). Automatisiertes Verständnis von formularbasierten Webseiten durch statistische Klassifikation der Seiten und Elemente [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26549
Download: PDF (1.06 MB) -
Data cleaning and performance tuning in the GAINS model
/
Makowski, M. P. (2008). Data cleaning and performance tuning in the GAINS model [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-23344
Download: PDF (4.03 MB) - Open Source Java EE Application Server functionality, configuration and performance on the basis of Geronimo, JBoss and Glassfish / Kofler, M. J. (2008). Open Source Java EE Application Server functionality, configuration and performance on the basis of Geronimo, JBoss and Glassfish [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179750
- VENTip : methodology and implementation of table interpretation / Bohunsky, P. (2008). VENTip : methodology and implementation of table interpretation [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179744
- Data representation, queries and updates in probabilistic and uncertain databases / Ostrcil, R. (2008). Data representation, queries and updates in probabilistic and uncertain databases [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179739
2007
-
Techniken und Werkzeuge für objekt-relationale Abbildungen
/
Schmitt, D. (2007). Techniken und Werkzeuge für objekt-relationale Abbildungen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-21075
Download: PDF (794 KB) -
Implementing core computation for data exchange
/
Savenkov, V. (2007). Implementing core computation for data exchange [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-17263
Download: PDF (882 KB) - Efficient algorithms through bounded treewidth / Jakl, M. (2007). Efficient algorithms through bounded treewidth [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/178012
2006
-
Business intelligence in the logistic domain using visual information extraction
/
Díaz Prado, J. A. (2006). Business intelligence in the logistic domain using visual information extraction [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-14487
Download: PDF (4.19 MB)
2005
- Requirements and system design for next generation web data extraction and integration / Ledermüller, G. (2005). Requirements and system design for next generation web data extraction and integration [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182956
Awards
-
Best Paper Award at the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
2022 / ACM SIGMOD / USA / Website -
2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation
2021 / ACM SIGLOG / USA / Website -
Best paper award at RR 2010: Int. Conf. on Web Reasoning and Rule Systems
2010 / Italy
And more…
Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.
Until then, please visit Reinhard Pichler’s research profile in TISS .