TU Wien Informatics

20 Years

Mantas Simkus

Univ.Ass. Dr.techn. / MSc

Research Focus

Research Areas

  • Logic Programming, Computational Complexity, Nonmonotonic Reasoning, Knowledge representation
Mantas Simkus

About

Databases and Artificial Intelligence

Role

2023W

2024S

 

2023

  • Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting (Extended Abstract) / Ahmetaj, S., Ortiz de la Fuente, M. M., Oudshoorn, A. M., & Simkus, M. (2023). Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting (Extended Abstract). In Proceedings of the 36th International Workshop on Description Logics (DL 2023), co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023). 36th International Workshop on Description Logics (DL 2023), Rhodos, Greece. CEUR-WS.org. https://doi.org/10.34726/5397
    Download: PDF (988 KB)
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025)
  • Circumscription in DL-Lite: Progress Report / Bonatti, P., Di Stefano, F., Ortiz, M., & Šimkus, M. (2023). Circumscription in DL-Lite: Progress Report. In O. Kutz, C. Lutz, & A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning  (KR 2023). CEUR-WS.org. https://doi.org/10.34726/5328
    Download: PDF (1.28 MB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting / Ahmetaj, S., Ortiz, M., Oudshoorn, A., & Šimkus, M. (2023). Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting. In K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, & R. Rădulescu (Eds.), ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 27–35). IOS Press. https://doi.org/10.3233/FAIA230250
    Download: PDF (342 KB)
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • The biggest business process management problems to solve before we die / Beerepoot, I., Di Ciccio, C., Reijers, H. A., Rinderle-Ma, S., Bandara, W., Burattin, A., Calvanese, D., Chen, T., Cohen, I., Depaire, B., Di Federico, G., Dumas, M., van Dun, C., Fehrer, T., Fischer, D. A., Gal, A., Indulska, M., Isahagian, V., Klinkmüller, C., … Zerbato, F. (2023). The biggest business process management problems to solve before we die. Computers in Industry, 146, Article 103837. https://doi.org/10.1016/j.compind.2022.103837
    Download: PDF (3.65 MB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Description Logics with Pointwise Circumscription / Di Stefano, F., Ortiz, M., & Šimkus, M. (2023). Description Logics with Pointwise Circumscription. In E. Elking (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 3167–3175). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/353
    Download: PDF (193 KB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • On the Expressive Power of Ontology-Mediated Queries: Capturing coNP / Lukumbuzya, S., Ortiz de la Fuente, M. M., & Simkus, M. (2023). On the Expressive Power of Ontology-Mediated Queries: Capturing coNP. In O. Kutz, C. Lutz, & A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning  (KR 2023). CEUR-WS.org. https://doi.org/10.34726/5333
    Download: PDF (1.88 MB)
    Project: KtoAPP (2018–2025)

2022

  • Repairing SHACL Constraint Violations Using Answer Set Programming / Ahmetaj, S., David, R., Polleres, A., & Simkus, M. (2022). Repairing SHACL Constraint Violations Using Answer Set Programming. In The Semantic Web – ISWC 2022 (pp. 375–391). Springer. https://doi.org/10.1007/978-3-031-19433-7\_22
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Magic Shapes for SHACL Validation / Ahmetaj, S., Löhnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2022). Magic Shapes for SHACL Validation. Proceedings of the VLDB Endowment, 15(10), 2284--2296. https://doi.org/10.14778/3547305.3547329
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)

2021

  • Reasoning about Explanations for Non-validation in SHACL (Extended abstract) / Ahmetaj, S., David, R., Ortiz de la Fuente, M. M., Polleres, A., Shehu, B., & Simkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL (Extended abstract). In Proceedings of the 34th International Workshop on Description Logics (DL 2021). 34th International Workshop on Description Logics (DL 2021), Bratislava, Slovakia. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55685
  • Reasoning about Explanations for Non-validation in SHACL / Ahmetaj, S., David, R., Ortiz, M., Polleres, A., Shehu, B., & Šimkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/2
  • Magic Shapes for Validation in SHACL / Ahmetaj, S., Loehnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2021). Magic Shapes for Validation in SHACL. In Proceedings of the ISWC 2021 Posters, Demos and Industry Tracks: From Novel Ideas to Industrial Practice co-located with 20th International Semantic Web Conference (ISWC 2021). ISWC 2021 - The 20th International Semantic Web Conference, online event, Unknown. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55686
  • Bounded Predicates in Description Logics with Counting / Lukumbuzya, S., & Simkus, M. (2021). Bounded Predicates in Description Logics with Counting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/271
  • Process Mining with Common Sense / Calvanese, D., Lukumbuzya, S., Montali, M., & Simkus, M. (2021). Process Mining with Common Sense. In Proceedings of the International Workshop on BPM Problems to Solve Before We Die (PROBLEMS 2021) (pp. 45–50). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55664

2020

  • Ontologies and Data Management: A Brief Survey / Schneider, T., & Šimkus, M. (2020). Ontologies and Data Management: A Brief Survey. Kuenstliche Intelligenz, 34(3), 329–353. https://doi.org/10.1007/s13218-020-00686-3
  • Resilient Logic Programs: Answer Set Programs Challenged by Ontologies / Ortiz de la Fuente, M. M., Simkus, M., & Lukumbuzya, S. (2020). Resilient Logic Programs: Answer Set Programs Challenged by Ontologies. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2917–2924). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5683
  • Special Issue on Ontologies and Data Management: Part I / Schneider, T., & Šimkus, M. (2020). Special Issue on Ontologies and Data Management: Part I. Kuenstliche Intelligenz, 34(3), 287–289. https://doi.org/10.1007/s13218-020-00682-7
  • Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog / Ahmetaj, S., Ortiz, M., & Šimkus, M. (2020). Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog. Artificial Intelligence, 280(103220), 103220. https://doi.org/10.1016/j.artint.2019.103220
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Interview with Diego Calvanese / Calvanese, D., & Šimkus, M. (2020). Interview with Diego Calvanese. KI - Künstliche Intelligenz, 34(4), 551–555. https://doi.org/10.1007/s13218-020-00691-6
  • Special Issue on Ontologies and Data Management: Part II / Schneider, T., & Šimkus, M. (2020). Special Issue on Ontologies and Data Management: Part II. KI - Künstliche Intelligenz, 34(4), 439–441. https://doi.org/10.1007/s13218-020-00693-4
  • Stable Model Semantics for Recursive SHACL / Andresel, M., Corman, J., Ortiz, M., Reutter, J. L., Savkovic, O., & Simkus, M. (2020). Stable Model Semantics for Recursive SHACL. In Proceedings of The Web Conference 2020. International World Wide Web Conference (WWW), UK, EU. ACM. https://doi.org/10.1145/3366423.3380229
  • Query Rewriting for Ontology-Mediated Conditional Answers / Andresel, M., Ortiz, M., & Simkus, M. (2020). Query Rewriting for Ontology-Mediated Conditional Answers. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2734–2741). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5660
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • An ExpTime Upper Bound for ALC with Integers / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/61
  • Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates / Gogacz, T., Lukumbuzya, S., Simkus, M., & Ortiz de la Fuente, M. M. (2020). Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/44
  • Ontology Focusing: Knowledge-Enriched Databases on Demand / Gogacz, T., Gutierrez-Basulto, V., Ibanez Garcia, Y. A., Murlak, F., Ortiz de la Fuente, M. M., & Simkus, M. (2020). Ontology Focusing: Knowledge-Enriched Databases on Demand. In ECAI 2020 - 24th European Conference on Artificial Intelligence (pp. 745–752). Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/55576
  • An ExpTime Upper Bound for ALC with Integers (Extended Version) / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers (Extended Version) (2006.02078). http://hdl.handle.net/20.500.12708/40248

2019

2018

  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2018). The Impact of Active Domain Predicates on Guarded Existential Rules. Fundamenta Informaticae, 159(1–2), 123–146. https://doi.org/10.3233/fi-2018-1660
  • Rewriting Guarded Existential Rules into Small Datalog Programs / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Rewriting Guarded Existential Rules into Small Datalog Programs. In B. Kimelfeld & Y. Amsterdamer (Eds.), 21st International Conference on Database Theory, {ICDT} 2018 (pp. 1–24). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2018.4
  • Satisfiability in the Triguarded Fragment of First-Order Logic / Rudolph, S., & Simkus, M. (2018). Satisfiability in the Triguarded Fragment of First-Order Logic. In Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to - 29th, 2018. (p. 12). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57722
  • The Triguarded Fragment of First-Order Logic / Rudolph, S., & Simkus, M. (2018). The Triguarded Fragment of First-Order Logic. In LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018 (pp. 604–619). EasyChair EPiC Series in Computing. http://hdl.handle.net/20.500.12708/57720
  • Compiling Model Representations for Querying Large ABoxes in Expressive DLs / Bajraktari, L., Ortiz, M., & Simkus, M. (2018). Compiling Model Representations for Querying Large ABoxes in Expressive DLs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. https://doi.org/10.24963/ijcai.2018/234
  • Combining Rules and Ontologies into Clopen Knowledge Bases / Bajraktari, L., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Combining Rules and Ontologies into Clopen Knowledge Bases. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence e (AAAI-18) (pp. 1728–1735). http://hdl.handle.net/20.500.12708/57703
  • Relaxing and Restraining Queries for OBDA - Extended Abstract / Andresel, M.-P., Ibanez Garcia, Y. A., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Relaxing and Restraining Queries for OBDA - Extended Abstract. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October-2 November 2018. (pp. 617–618). http://hdl.handle.net/20.500.12708/57608
  • Taming Complex Role Inclusions for DL-Lite / Andresel, M.-P., Ibanez Garcia, Y. A., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Taming Complex Role Inclusions for DL-Lite. In Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to - 29th, 2018. (p. 12). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57607

2017

  • Managing Change in Graph-Structured Data Using Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Managing Change in Graph-Structured Data Using Description Logics. ACM Transactions on Computational Logic, 18(4), 1–35. https://doi.org/10.1145/3143803
  • Contributions to logic-based data management / Šimkus, M. (2017). Contributions to logic-based data management [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159382
  • Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming / Bajraktari, L., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming. In A. Artale, B. Glimm, & R. Kontchakov (Eds.), Proceedings of the 30th International Workshop on Description Logics (pp. 1–13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55477

2016

  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2016). The Impact of Active Domain Predicates on Guarded Existential Rules. In M. M. Ortiz de la Fuente & S. Schlobach (Eds.), Web Reasoning and Rule Systems (pp. 94–110). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-45276-0_8
    Projects: HINT (2012–2017) / START (2014–2022)
  • Verification of Evolving Graph-structured Data under Expressive Path Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Verification of Evolving Graph-structured Data under Expressive Path Constraints. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 15:1-15:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.15
    Projects: HINT (2012–2017) / SEE (2012–2016) / SemDat (2012–2016)
  • Managing Change in Graph-Structured Data Using Description Logics / Ortiz de la Fuente, M. M., & Simkus, M. (2016). Managing Change in Graph-Structured Data Using Description Logics. Workshop on New Trends in Belief Change, Vienna, Austria. http://hdl.handle.net/20.500.12708/86468
    Project: SemDat (2012–2016)
  • A Compilation Technique for Interactive Ontology-mediated Data Exploration / Andresel, M.-P., Ortiz de la Fuente, M. M., & Simkus, M. (2016). A Compilation Technique for Interactive Ontology-mediated Data Exploration. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 12). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56678
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 13). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56673
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • 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)
  • 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 C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, {KR} 2016, Cape Town, South Africa, April 25-29, 2016. (pp. 237–246). AAAI Press. http://hdl.handle.net/20.500.12708/56676
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 878–885). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56675
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • 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.), Lecture Notes in Computer Science (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)

2015

  • Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms / Bienvenu, M., Ortiz, M., & Simkus, M. (2015). Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms. Journal of Artificial Intelligence Research, 53, 315–374. https://doi.org/10.1613/jair.4577
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Linking Open-World Knowledge Bases Using Nonmonotonic Rules / Eiter, T., & Simkus, M. (2015). Linking Open-World Knowledge Bases Using Nonmonotonic Rules. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 294–308). Springer LNCS. https://doi.org/10.1007/978-3-319-23264-5_25
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / HINT (2012–2017) / SEE (2012–2016)
  • 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)
  • The Combined Complexity of Reasoning with Closed Predicates in Description Logics / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2015). The Combined Complexity of Reasoning with Closed Predicates in Description Logics. In D. Calvanese & B. Konev (Eds.), Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (pp. 249–261). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55398
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2015). Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results. In Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (pp. 162–171). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55397
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Binary Frontier-Guarded ASP with Function Symbols / Šimkus, M. (2015). Binary Frontier-Guarded ASP with Function Symbols. In N. Bassiliades, G. Gottlob, F. Sadri, A. Paschke, & D. Roman (Eds.), Rule Technologies: Foundations, Tools, and Applications (pp. 311–327). Springer LNCS. https://doi.org/10.1007/978-3-319-21542-6_20
    Projects: HINT (2012–2017) / Hybride Wissensbasen (2008–2012) / SEE (2012–2016)
  • 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)
  • 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)
  • A Rule-based Framework for Creating Instance Data from OpenStreetMap / Eiter, T., Pan, J. Z., Schneider, P., Šimkus, M., & Xiao, G. (2015). A Rule-based Framework for Creating Instance Data from OpenStreetMap. In B. ten Cate & A. Mileo (Eds.), Web Reasoning and Rule Systems (pp. 93–104). Springer LNCS. https://doi.org/10.1007/978-3-319-22002-4_8
    Projects: ASP (2012–2015) / HINT (2012–2017) / SEE (2012–2016)
  • Extending ALCQIO with Trees / Kotek, T., imkus, M., Veith, H., & Zuleger, F. (2015). Extending ALCQIO with Trees. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015), Kyoto, Japan, Austria. IEEE. https://doi.org/10.1109/lics.2015.54
    Projects: Automated Bound Analysis (2013–2016) / FAIR (2013–2018) / PROSEED (2011–2015) / SEE (2012–2016)

2014

  • Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability / Kotek, T., Simkus, M., Veith, H., & Zuleger, F. (2014). Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. In International Workshop on Description Logics (p. 4). http://hdl.handle.net/20.500.12708/55329
  • Shape and Content: Incorporating Domain Knowledge into Shape Analysis / Calvanese, D., Kotek, T., Simkus, M., Veith, H., & Zuleger, F. (2014). Shape and Content: Incorporating Domain Knowledge into Shape Analysis. In International Workshop on Description Logics (p. 4). http://hdl.handle.net/20.500.12708/55330
  • SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment / Ahmeti, A., Calvanese, D., & Polleres, A. (2014). SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014 (p. 13). CEUR-WS. http://hdl.handle.net/20.500.12708/55895
    Project: SEE (2012–2016)
  • 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)
  • Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures / Calvanese, D., Kotek, T., Šimkus, M., Veith, H., & Zuleger, F. (2014). Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. In E. Albert & E. Sekerinski (Eds.), Integrated Formal Methods (pp. 3–17). Springer / LNCS. https://doi.org/10.1007/978-3-319-10181-1_1
  • Towards Practical Deletion Repair of Inconsistent DL-programs / Eiter, T., Fink, M., & Stepanova, D. (2014). Towards Practical Deletion Repair of Inconsistent DL-programs. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 169–180). CEUR-WS. http://hdl.handle.net/20.500.12708/55751
    Project: ASP (2012–2015)
  • Contextualized Knowledge Repositories with Justifiable Exceptions / Bozzato, L., Eiter, T., & Serafini, L. (2014). Contextualized Knowledge Repositories with Justifiable Exceptions. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 112–123). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55719
  • Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners 51-57 / Eiter, T., Schneider, P., Simkus, M., & Xiao, G. (2014). Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners 51-57. In Informal Proceedings of the 3rd International Workshop on OWL Reasoner Evaluation (ORE 2014) (pp. 51–57). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55387
    Projects: FAIR (2013–2018) / SEE (2012–2016)
  • Nested Regular Path Queries in Description Logics (Extended Abstract) / Bienvenu, M., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Nested Regular Path Queries in Description Logics (Extended Abstract). In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55386
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Planning Problems for Graph Structured Data in Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Planning Problems for Graph Structured Data in Description Logics. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 4–7). CEUR-WS. http://hdl.handle.net/20.500.12708/55993
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Expressiveness of guarded existential rule languages / Gottlob, G., Rudolph, S., & Simkus, M. (2014). Expressiveness of guarded existential rule languages. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM Press. https://doi.org/10.1145/2594538.2594556
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Revisiting the Hardness of Query Answering in Expressive Description Logics / Ortiz, M., & Šimkus, M. (2014). Revisiting the Hardness of Query Answering in Expressive Description Logics. In R. Kontchakov & M.-L. Mugnier (Eds.), Web Reasoning and Rule Systems (pp. 216–223). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-11113-1_18
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Nested Regular Path Queries in Description Logics / Bienvenu, M., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Nested Regular Path Queries in Description Logics. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (KR 2014) (pp. 218–227). AAAI Press. http://hdl.handle.net/20.500.12708/55963
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Planning and Change in Graph Structured Data under Description Logics Constraints / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Planning and Change in Graph Structured Data under Description Logics Constraints. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR-Proceedings. http://hdl.handle.net/20.500.12708/55930
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Managing Change in Graph-Structured Data Using Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Managing Change in Graph-Structured Data Using Description Logics. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 966–973). AAAI Press/IJCAI. http://hdl.handle.net/20.500.12708/55928
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (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)
  • Informal Proceedings of the 27th International Workshop on Description Logics / Informal Proceedings of the 27th International Workshop on Description Logics. (2014). In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), CEUR Workshop Proceedings. CEUR-Proceedings. http://hdl.handle.net/20.500.12708/23938

2013

  • Reasoning about Explanations for Negative Query Answers in DL-Lite / Calvanese, D., Ortiz, M., Simkus, M., & Stefanoni, G. (2013). Reasoning about Explanations for Negative Query Answers in DL-Lite. Journal of Artificial Intelligence Research, 48, 635–669. https://doi.org/10.1613/jair.3870
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Tractability Guarantees for DL-Lite Query Answering / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractability Guarantees for DL-Lite Query Answering. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 41–52). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55142
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Evolving Graph Databases under Description Logic Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Evolving Graph Databases under Description Logic Constraints. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 120–131). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55141
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Conjunctive Regular Path Queries in Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Conjunctive Regular Path Queries in Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 761–767). AAAI Press. http://hdl.handle.net/20.500.12708/55043
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Tractable Queries for Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractable Queries for Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 768–774). AAAI Press. http://hdl.handle.net/20.500.12708/55042
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)

2012

  • The Complexity of Explaining Negative Query Answers in DL-Lite / Calvanese, D., Ortiz de la Fuente, M. M., Simkus, M., & Stefanoni, G. (2012). The Complexity of Explaining Negative Query Answers in DL-Lite. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012 (pp. 583–587). AAAI Press. http://hdl.handle.net/20.500.12708/54355
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Conjunctive query answering in the description logic SH using knots / Eiter, T., Ortiz, M., & Šimkus, M. (2012). Conjunctive query answering in the description logic SH using knots. Journal of Computer and System Sciences, 78(1), 47–85. https://doi.org/10.1016/j.jcss.2011.02.012
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Answering Expressive Path Queries over Lightweight DL Knowledge Bases / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2012). Answering Expressive Path Queries over Lightweight DL Knowledge Bases. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 81–91). http://hdl.handle.net/20.500.12708/54354
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Towards Practical Query Answering for Horn SHIQ. / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Towards Practical Query Answering for Horn SHIQ. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 158–168). CEUR workshop proceedings. http://hdl.handle.net/20.500.12708/54289
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • Datalog and Its Extensions for Semantic Web Databases / Gottlob, G., Orsi, G., Pieris, A., & Šimkus, M. (2012). Datalog and Its Extensions for Semantic Web Databases. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 54–77). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_2
  • Reasoning and Query Answering in Description Logics / Ortiz, M., & Šimkus, M. (2012). Reasoning and Query Answering in Description Logics. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 1–53). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_1
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • Query Rewriting for Horn-SHIQ Plus Rules / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Query Rewriting for Horn-SHIQ Plus Rules. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 726–733). AAAI Press. http://hdl.handle.net/20.500.12708/54357
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)

2011

  • The Complexity of Conjunctive Query Abduction in DL-Lite / Calvanese, D., Ortiz de la Fuente, M. M., Simkus, M., & Stefanoni, G. (2011). The Complexity of Conjunctive Query Abduction in DL-Lite. In R. Rosati, S. Rudolph, & M. Zakharyaschev (Eds.), CEUR Workshop Proceedings (p. 11). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/53694
  • Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ / Ortiz de la Fuente, M. M., Rudolph, S., & Simkus, M. (2011). Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 1039–1044). AAAI Press/International Joint Conferences on Artificial Intelligence. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-178
    Project: Hybride Wissensbasen (2008–2012)
  • Containment of Regular Path Queries under Description Logic Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2011). Containment of Regular Path Queries under Description Logic Constraints. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 805–812). AAAI Press/International Joint Conferences on Artificial Intelligence. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-141
  • D3.4 Converged and Optimized Combinations of Rules and Ontologies / Feier, C., Eiter, T., Kifer, M., Mosca, A., Rezk, M., Rosati, R., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2011). D3.4 Converged and Optimized Combinations of Rules and Ontologies (D3.4). http://hdl.handle.net/20.500.12708/37097

2010

2009

2008

  • Reasoning Using Knots / Eiter, T., Ortiz, M., & Šimkus, M. (2008). Reasoning Using Knots. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 377–390). Lecture Notes in Computer Science, Springer. https://doi.org/10.1007/978-3-540-89439-1_27
  • Query Answering in the Description Logic Horn-SHIQ / Eiter, T., Gottlob, G., Ortiz, M., & Šimkus, M. (2008). Query Answering in the Description Logic Horn-SHIQ. In S. Hölldobler, C. Lutz, & H. Wansing (Eds.), Logics in Artificial Intelligence: 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings (pp. 166–179). Lecture Notes in Artificial Intelligence. https://doi.org/10.1007/978-3-540-87803-2_15
  • Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses / Ortiz de la Fuente, M. M., Simkus, M., & Eiter, T. (2008). Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses. In D. Fox & C. P. Gomes (Eds.), 23rd AAAI Conference on Artificial Intelligence (pp. 504–510). AAAI Press. http://hdl.handle.net/20.500.12708/52283
  • Conjunctive Query Answering in SH using Knots / Ortiz de la Fuente, M. M., Simkus, M., & Eiter, T. (2008). Conjunctive Query Answering in SH using Knots. In F. Baader, C. Lutz, & B. Motik (Eds.), Proceedings of the 21st International Workshop on Description Logics (DL2008) (p. 11). CEUR Workshop proceedings. http://hdl.handle.net/20.500.12708/52270
  • Complexity of Conjunctive Query Answering in Description Logics with Transitive Roles / Eiter, T., Lutz, C., Ortiz de la Fuente, M. M., & Simkus, M. (2008). Complexity of Conjunctive Query Answering in Description Logics with Transitive Roles (INFSYS RR-1843-08-09). http://hdl.handle.net/20.500.12708/35361
  • FDNC: Decidable Nonmonotonic Disjunctive Logic Programs with Function Symbols / Simkus, M., & Eiter, T. (2008). FDNC: Decidable Nonmonotonic Disjunctive Logic Programs with Function Symbols (INFSYS RR-1843-08-01). http://hdl.handle.net/20.500.12708/35353

2007

  • FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols / Simkus, M., & Eiter, T. (2007). FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. In N. Dershowitz & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 514–530). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-75560-9_37

2006