---
_id: '65178'
abstract:
- lang: eng
  text: "Large intermediate results can cause join queries to run unexpectedly long.
    This problem is particularly common for analytical queries, which aggregate data
    over many tables to produce a comparatively small final output, and queries on
    graph data, where intermediate results blow up quickly. Recent work inspired by
    Yannakakis’ algorithm approaches this by modifying the query engine to avoid materializing
    unnecessary tuples. However, this requires significant changes to the core of
    the system, which is not feasible in many situations such as cloud environments
    or proprietary systems.\r\nIn this work, we propose a flexible approach for optimizing
    long-running join queries from the outside of the DBMS. Rewriting-based realizations
    of Yannakakis’ algorithm suffer from inherent overhead due to the creation of
    intermediate tables. Thus, we present an approach for detecting and targeting
    queries which would benefit from a Yannakakis-style optimization. We introduce
    a new benchmark combining 5 standard benchmarks and augmenting them with additional
    instances, which provides a sufficient size and diversity for a machine learning
    based solution. On PostgreSQL, DuckDB and SparkSQL, slowdowns on queries where
    the rewriting is counterproductive are mostly avoided, as opposed to a naïve application
    of the rewriting, and we observe significant improvements in end-to-end runtimes
    over standard query execution and unconditional rewriting."
author:
- first_name: Daniela
  full_name: Böhm, Daniela
  last_name: Böhm
- first_name: Georg
  full_name: Gottlob, Georg
  last_name: Gottlob
- first_name: Matthias
  full_name: Lanzinger, Matthias
  last_name: Lanzinger
- first_name: Davide Mario
  full_name: Longo, Davide Mario
  last_name: Longo
- first_name: Cem
  full_name: Okulmus, Cem
  id: '114410'
  last_name: Okulmus
  orcid: 0000-0002-7742-0439
- first_name: Reinhard
  full_name: Pichler, Reinhard
  last_name: Pichler
- first_name: Alexander
  full_name: Selzer, Alexander
  last_name: Selzer
citation:
  ama: 'Böhm D, Gottlob G, Lanzinger M, et al. Selective Use of Yannakakis’ Algorithm
    for Consistent Performance Gains. In: <i>Proceedings of the 28th International
    Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
    (DOLAP 2026)</i>. ; 2026.'
  apa: Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R.,
    &#38; Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent
    Performance Gains. <i>Proceedings of the 28th International Workshop on Design,
    Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>.
  bibtex: '@inproceedings{Böhm_Gottlob_Lanzinger_Longo_Okulmus_Pichler_Selzer_2026,
    place={Tampere, Finland}, title={Selective Use of Yannakakis’ Algorithm for Consistent
    Performance Gains}, booktitle={Proceedings of the 28th International Workshop
    on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP
    2026)}, author={Böhm, Daniela and Gottlob, Georg and Lanzinger, Matthias and Longo,
    Davide Mario and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander}, year={2026}
    }'
  chicago: Böhm, Daniela, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem
    Okulmus, Reinhard Pichler, and Alexander Selzer. “Selective Use of Yannakakis’
    Algorithm for Consistent Performance Gains.” In <i>Proceedings of the 28th International
    Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
    (DOLAP 2026)</i>. Tampere, Finland, 2026.
  ieee: D. Böhm <i>et al.</i>, “Selective Use of Yannakakis’ Algorithm for Consistent
    Performance Gains,” 2026.
  mla: Böhm, Daniela, et al. “Selective Use of Yannakakis’ Algorithm for Consistent
    Performance Gains.” <i>Proceedings of the 28th International Workshop on Design,
    Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026)</i>,
    2026.
  short: 'D. Böhm, G. Gottlob, M. Lanzinger, D.M. Longo, C. Okulmus, R. Pichler, A.
    Selzer, in: Proceedings of the 28th International Workshop on Design, Optimization,
    Languages and Analytical Processing of Big Data (DOLAP 2026), Tampere, Finland,
    2026.'
date_created: 2026-03-27T15:20:54Z
date_updated: 2026-03-27T15:22:01Z
department:
- _id: '888'
keyword:
- Join Queries
- Acyclic Queries
- Query Processing
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://ceur-ws.org/Vol-4186/paper2.pdf
oa: '1'
place: Tampere, Finland
publication: Proceedings of the 28th International Workshop on Design, Optimization,
  Languages and Analytical Processing of Big Data (DOLAP 2026)
status: public
title: Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '59840'
abstract:
- lang: eng
  text: "The Semantic Web and Graph Database communities have developed three distinct
    schema languages for RDF and graph-structured data: SHACL, ShEx, and PG-Schema.
    Each language has its unique approach to defining constraints and validating graph
    data. In this work, we provide formal, concise definitions of the core components
    of each of these schema languages. We employ a uniform framework to facilitate
    a comprehensive comparison between the languages and identify a common set of
    functionalities, shedding light on both overlapping and distinctive features of
    the three languages.\r\n"
author:
- first_name: Shqiponja
  full_name: Ahmetaj, Shqiponja
  last_name: Ahmetaj
- first_name: Iovka
  full_name: Boneva, Iovka
  last_name: Boneva
- first_name: Jan
  full_name: Hidders, Jan
  last_name: Hidders
- first_name: Katja
  full_name: Hose, Katja
  last_name: Hose
- first_name: Maxime
  full_name: Jakubowski, Maxime
  last_name: Jakubowski
- first_name: Jose Emilio
  full_name: Labra Gayo, Jose Emilio
  last_name: Labra Gayo
- first_name: Wim
  full_name: Martens, Wim
  last_name: Martens
- first_name: Fabio
  full_name: Mogavero, Fabio
  last_name: Mogavero
- first_name: Filip
  full_name: Murlak, Filip
  last_name: Murlak
- first_name: Cem
  full_name: Okulmus, Cem
  id: '114410'
  last_name: Okulmus
  orcid: 0000-0002-7742-0439
- first_name: Axel
  full_name: Polleres, Axel
  last_name: Polleres
- first_name: Ognjen
  full_name: Savković, Ognjen
  last_name: Savković
- first_name: Mantas
  full_name: Šimkus, Mantas
  last_name: Šimkus
- first_name: Dominik
  full_name: Tomaszuk, Dominik
  last_name: Tomaszuk
citation:
  ama: 'Ahmetaj S, Boneva I, Hidders J, et al. Common Foundations for SHACL, ShEx,
    and PG-Schema. In: <i>Proceedings of the ACM on Web Conference 2025</i>. ACM;
    2025:8-12. doi:<a href="https://doi.org/10.1145/3696410.3714694">10.1145/3696410.3714694</a>'
  apa: Ahmetaj, S., Boneva, I., Hidders, J., Hose, K., Jakubowski, M., Labra Gayo,
    J. E., Martens, W., Mogavero, F., Murlak, F., Okulmus, C., Polleres, A., Savković,
    O., Šimkus, M., &#38; Tomaszuk, D. (2025). Common Foundations for SHACL, ShEx,
    and PG-Schema. <i>Proceedings of the ACM on Web Conference 2025</i>, 8–12. <a
    href="https://doi.org/10.1145/3696410.3714694">https://doi.org/10.1145/3696410.3714694</a>
  bibtex: '@inproceedings{Ahmetaj_Boneva_Hidders_Hose_Jakubowski_Labra Gayo_Martens_Mogavero_Murlak_Okulmus_et
    al._2025, title={Common Foundations for SHACL, ShEx, and PG-Schema}, DOI={<a href="https://doi.org/10.1145/3696410.3714694">10.1145/3696410.3714694</a>},
    booktitle={Proceedings of the ACM on Web Conference 2025}, publisher={ACM}, author={Ahmetaj,
    Shqiponja and Boneva, Iovka and Hidders, Jan and Hose, Katja and Jakubowski, Maxime
    and Labra Gayo, Jose Emilio and Martens, Wim and Mogavero, Fabio and Murlak, Filip
    and Okulmus, Cem and et al.}, year={2025}, pages={8–12} }'
  chicago: Ahmetaj, Shqiponja, Iovka Boneva, Jan Hidders, Katja Hose, Maxime Jakubowski,
    Jose Emilio Labra Gayo, Wim Martens, et al. “Common Foundations for SHACL, ShEx,
    and PG-Schema.” In <i>Proceedings of the ACM on Web Conference 2025</i>, 8–12.
    ACM, 2025. <a href="https://doi.org/10.1145/3696410.3714694">https://doi.org/10.1145/3696410.3714694</a>.
  ieee: 'S. Ahmetaj <i>et al.</i>, “Common Foundations for SHACL, ShEx, and PG-Schema,”
    in <i>Proceedings of the ACM on Web Conference 2025</i>, Sidney, Australia, 2025,
    pp. 8–12, doi: <a href="https://doi.org/10.1145/3696410.3714694">10.1145/3696410.3714694</a>.'
  mla: Ahmetaj, Shqiponja, et al. “Common Foundations for SHACL, ShEx, and PG-Schema.”
    <i>Proceedings of the ACM on Web Conference 2025</i>, ACM, 2025, pp. 8–12, doi:<a
    href="https://doi.org/10.1145/3696410.3714694">10.1145/3696410.3714694</a>.
  short: 'S. Ahmetaj, I. Boneva, J. Hidders, K. Hose, M. Jakubowski, J.E. Labra Gayo,
    W. Martens, F. Mogavero, F. Murlak, C. Okulmus, A. Polleres, O. Savković, M. Šimkus,
    D. Tomaszuk, in: Proceedings of the ACM on Web Conference 2025, ACM, 2025, pp.
    8–12.'
conference:
  end_date: 2025-05-02
  location: Sidney, Australia
  name: 'ACM Web Conference 2025 '
  start_date: 2025-04-28
date_created: 2025-05-07T11:46:03Z
date_updated: 2025-05-07T11:51:17Z
department:
- _id: '888'
doi: 10.1145/3696410.3714694
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2502.01295
oa: '1'
page: 8-12
publication: Proceedings of the ACM on Web Conference 2025
publication_status: published
publisher: ACM
status: public
title: Common Foundations for SHACL, ShEx, and PG-Schema
type: conference
user_id: '114410'
year: '2025'
...
---
_id: '63786'
author:
- first_name: Bianca
  full_name: Löhnert, Bianca
  last_name: Löhnert
- first_name: Nikolaus
  full_name: Augsten, Nikolaus
  last_name: Augsten
- first_name: Cem
  full_name: Okulmus, Cem
  id: '114410'
  last_name: Okulmus
  orcid: 0000-0002-7742-0439
- first_name: Magdalena
  full_name: Ortiz, Magdalena
  last_name: Ortiz
citation:
  ama: 'Löhnert B, Augsten N, Okulmus C, Ortiz M. Query Rewriting for Nested Navigational
    Queries over Property Graphs. In: Tendera L, Ibanez Garcia Y, Koopmann P, eds.
    <i>Proceedings of the 38th International Workshop on Description Logics (DL 2025),
    Opole, Poland, September 3-6, 2025.</i> Vol 4091. CEUR Workshop Proceedings. ;
    2025.'
  apa: Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Query Rewriting
    for Nested Navigational Queries over Property Graphs. In L. Tendera, Y. Ibanez
    Garcia, &#38; P. Koopmann (Eds.), <i>Proceedings of the 38th International Workshop
    on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i> (Vol.
    4091).
  bibtex: '@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, place={Opole, Poland},
    series={CEUR Workshop Proceedings}, title={Query Rewriting for Nested Navigational
    Queries over Property Graphs}, volume={4091}, booktitle={Proceedings of the 38th
    International Workshop on Description Logics (DL 2025), Opole, Poland, September
    3-6, 2025.}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and
    Ortiz, Magdalena}, editor={Tendera, Lidia and Ibanez Garcia, Yazmin and Koopmann,
    Patrick}, year={2025}, collection={CEUR Workshop Proceedings} }'
  chicago: Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Query
    Rewriting for Nested Navigational Queries over Property Graphs.” In <i>Proceedings
    of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland,
    September 3-6, 2025.</i>, edited by Lidia Tendera, Yazmin Ibanez Garcia, and Patrick
    Koopmann, Vol. 4091. CEUR Workshop Proceedings. Opole, Poland, 2025.
  ieee: B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Query Rewriting for Nested
    Navigational Queries over Property Graphs,” in <i>Proceedings of the 38th International
    Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i>,
    2025, vol. 4091.
  mla: Löhnert, Bianca, et al. “Query Rewriting for Nested Navigational Queries over
    Property Graphs.” <i>Proceedings of the 38th International Workshop on Description
    Logics (DL 2025), Opole, Poland, September 3-6, 2025.</i>, edited by Lidia Tendera
    et al., vol. 4091, 2025.
  short: 'B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: L. Tendera, Y. Ibanez
    Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on
    Description Logics (DL 2025), Opole, Poland, September 3-6, 2025., Opole, Poland,
    2025.'
date_created: 2026-01-28T10:37:05Z
date_updated: 2026-01-28T10:38:17Z
department:
- _id: '888'
editor:
- first_name: Lidia
  full_name: Tendera, Lidia
  last_name: Tendera
- first_name: Yazmin
  full_name: Ibanez Garcia, Yazmin
  last_name: Ibanez Garcia
- first_name: Patrick
  full_name: Koopmann, Patrick
  last_name: Koopmann
intvolume: '      4091'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://ceur-ws.org/Vol-4091/paper40.pdf
oa: '1'
place: Opole, Poland
publication: Proceedings of the 38th International Workshop on Description Logics
  (DL 2025), Opole, Poland, September 3-6, 2025.
publication_status: published
series_title: CEUR Workshop Proceedings
status: public
title: Query Rewriting for Nested Navigational Queries over Property Graphs
type: conference
user_id: '114410'
volume: 4091
year: '2025'
...
---
_id: '61065'
abstract:
- lang: eng
  text: Abduction is the task of computing a sufficient extension of a knowledge base
    (KB) that entails a conclusion not entailed by the original KB. It serves to compute
    explanations, or hypotheses, for such missing entailments. While this task has
    been intensively investigated for perfect data and under classical semantics,
    less is known about abduction when erroneous data results in inconsistent KBs.
    In this paper we define a suitable notion of abduction under repair semantics
    and propose a set of minimality criteria that guides abduction towards `useful'
    hypotheses. We provide initial complexity results on deciding existence of and
    verifying abductive solutions with these criteria, under different repair semantics
    and for the description logics DL-Lite and EL_bot.
author:
- first_name: Anselm
  full_name: Haak, Anselm
  id: '109969'
  last_name: Haak
- first_name: Patrick
  full_name: Koopmann, Patrick
  last_name: Koopmann
- first_name: Yasir
  full_name: Mahmood, Yasir
  id: '99353'
  last_name: Mahmood
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction
    beyond Repairs. <i>arXiv:250721955</i>. Published online 2025.
  apa: Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing
    ABox Abduction beyond Repairs. In <i>arXiv:2507.21955</i>.
  bibtex: '@article{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing
    ABox Abduction beyond Repairs}, journal={arXiv:2507.21955}, author={Haak, Anselm
    and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, year={2025}
    }'
  chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
    “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>,
    2025.
  ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox
    Abduction beyond Repairs,” <i>arXiv:2507.21955</i>. 2025.
  mla: Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>,
    2025.
  short: A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, ArXiv:2507.21955 (2025).
date_created: 2025-08-29T07:58:08Z
date_updated: 2026-02-05T13:55:48Z
department:
- _id: '574'
- _id: '888'
external_id:
  arxiv:
  - '2507.21955'
language:
- iso: eng
project:
- _id: '121'
  name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
    maschinellen Lernens'
publication: arXiv:2507.21955
status: public
title: Why not? Developing ABox Abduction beyond Repairs
type: preprint
user_id: '109969'
year: '2025'
...
---
_id: '63888'
author:
- first_name: Anselm
  full_name: Haak, Anselm
  id: '109969'
  last_name: Haak
- first_name: Patrick
  full_name: Koopmann, Patrick
  last_name: Koopmann
- first_name: Yasir
  full_name: Mahmood, Yasir
  id: '99353'
  last_name: Mahmood
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction
    beyond Repairs. In: Tendera L, Ibanez Garcia Y, Koopmann P, eds. <i>Proceedings
    of the 38th International Workshop on Description Logics - DL 2025</i>. ; 2025.'
  apa: Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing
    ABox Abduction beyond Repairs. In L. Tendera, Y. Ibanez Garcia, &#38; P. Koopmann
    (Eds.), <i>Proceedings of the 38th International Workshop on Description Logics
    - DL 2025</i>.
  bibtex: '@inproceedings{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing
    ABox Abduction beyond Repairs}, booktitle={Proceedings of the 38th International
    Workshop on Description Logics - DL 2025}, author={Haak, Anselm and Koopmann,
    Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, editor={Tendera, Lidia and
    Ibanez Garcia, Yazmin and Koopmann, Patrick}, year={2025} }'
  chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
    “Why Not? Developing ABox Abduction beyond Repairs.” In <i>Proceedings of the
    38th International Workshop on Description Logics - DL 2025</i>, edited by Lidia
    Tendera, Yazmin Ibanez Garcia, and Patrick Koopmann, 2025.
  ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox
    Abduction beyond Repairs,” in <i>Proceedings of the 38th International Workshop
    on Description Logics - DL 2025</i>, Opole, Poland, 2025.
  mla: Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>Proceedings
    of the 38th International Workshop on Description Logics - DL 2025</i>, edited
    by Lidia Tendera et al., 2025.
  short: 'A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: L. Tendera, Y. Ibanez
    Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on
    Description Logics - DL 2025, 2025.'
conference:
  end_date: 2025-09-06
  location: Opole, Poland
  name: Description Logics 2025
  start_date: 2025-09-03
date_created: 2026-02-05T13:54:08Z
date_updated: 2026-02-05T13:55:27Z
department:
- _id: '888'
- _id: '574'
editor:
- first_name: Lidia
  full_name: Tendera, Lidia
  last_name: Tendera
- first_name: Yazmin
  full_name: Ibanez Garcia, Yazmin
  last_name: Ibanez Garcia
- first_name: Patrick
  full_name: Koopmann, Patrick
  last_name: Koopmann
language:
- iso: eng
main_file_link:
- url: https://ceur-ws.org/Vol-4091/paper25.pdf
publication: Proceedings of the 38th International Workshop on Description Logics
  - DL 2025
status: public
title: Why not? Developing ABox Abduction beyond Repairs
type: conference
user_id: '109969'
year: '2025'
...
---
_id: '60496'
abstract:
- lang: eng
  text: <jats:p>Hypertree decompositions provide a way to evaluate Conjunctive Queries
    (CQs) in polynomial time, where the exponent of this polynomial is determined
    by the width of the decomposition. In theory, the goal of efficient CQ evaluation
    therefore has to be a minimisation of the width. However, in practical settings,
    it turns out that there are also other properties of a decomposition that influence
    the performance of query evaluation. It is therefore of interest to restrict the
    computation of decompositions by constraints and to guide this computation by
    preferences. To this end, we propose a novel framework based on candidate tree
    decompositions, which allows us to introduce soft hypertree width (shw). This
    width measure is a relaxation of hypertree width (hw); it is never greater than
    hw and, in some cases, shw may actually be lower than hw. Most importantly, shw
    preserves the tractability of deciding if a given CQ is below some fixed bound,
    while offering more algorithmic flexibility. In particular, it provides a natural
    way to incorporate preferences and constraints into the computation of decompositions.
    A prototype implementation and preliminary experiments confirm that this novel
    framework can indeed have a practical impact on query evaluation.</jats:p>
author:
- first_name: Matthias
  full_name: Lanzinger, Matthias
  last_name: Lanzinger
- first_name: Cem
  full_name: Okulmus, Cem
  id: '114410'
  last_name: Okulmus
  orcid: 0000-0002-7742-0439
- first_name: Reinhard
  full_name: Pichler, Reinhard
  last_name: Pichler
- first_name: Alexander
  full_name: Selzer, Alexander
  last_name: Selzer
- first_name: Georg
  full_name: Gottlob, Georg
  last_name: Gottlob
citation:
  ama: Lanzinger M, Okulmus C, Pichler R, Selzer A, Gottlob G. Soft and Constrained
    Hypertree Width. <i>Proceedings of the ACM on Management of Data</i>. 2025;3(2):1-25.
    doi:<a href="https://doi.org/10.1145/3725251">10.1145/3725251</a>
  apa: Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., &#38; Gottlob, G. (2025).
    Soft and Constrained Hypertree Width. <i>Proceedings of the ACM on Management
    of Data</i>, <i>3</i>(2), 1–25. <a href="https://doi.org/10.1145/3725251">https://doi.org/10.1145/3725251</a>
  bibtex: '@article{Lanzinger_Okulmus_Pichler_Selzer_Gottlob_2025, title={Soft and
    Constrained Hypertree Width}, volume={3}, DOI={<a href="https://doi.org/10.1145/3725251">10.1145/3725251</a>},
    number={2}, journal={Proceedings of the ACM on Management of Data}, publisher={Association
    for Computing Machinery (ACM)}, author={Lanzinger, Matthias and Okulmus, Cem and
    Pichler, Reinhard and Selzer, Alexander and Gottlob, Georg}, year={2025}, pages={1–25}
    }'
  chicago: 'Lanzinger, Matthias, Cem Okulmus, Reinhard Pichler, Alexander Selzer,
    and Georg Gottlob. “Soft and Constrained Hypertree Width.” <i>Proceedings of the
    ACM on Management of Data</i> 3, no. 2 (2025): 1–25. <a href="https://doi.org/10.1145/3725251">https://doi.org/10.1145/3725251</a>.'
  ieee: 'M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, and G. Gottlob, “Soft and
    Constrained Hypertree Width,” <i>Proceedings of the ACM on Management of Data</i>,
    vol. 3, no. 2, pp. 1–25, 2025, doi: <a href="https://doi.org/10.1145/3725251">10.1145/3725251</a>.'
  mla: Lanzinger, Matthias, et al. “Soft and Constrained Hypertree Width.” <i>Proceedings
    of the ACM on Management of Data</i>, vol. 3, no. 2, Association for Computing
    Machinery (ACM), 2025, pp. 1–25, doi:<a href="https://doi.org/10.1145/3725251">10.1145/3725251</a>.
  short: M. Lanzinger, C. Okulmus, R. Pichler, A. Selzer, G. Gottlob, Proceedings
    of the ACM on Management of Data 3 (2025) 1–25.
conference:
  end_date: 2025-06-27
  location: Berlin
  name: 44th ACM Symposium on Principles of Database Systems (PODS) 2025
  start_date: 2025-06-22
date_created: 2025-07-02T11:41:00Z
date_updated: 2025-07-02T11:45:18Z
department:
- _id: '888'
doi: 10.1145/3725251
intvolume: '         3'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2412.11669
oa: '1'
page: 1-25
publication: Proceedings of the ACM on Management of Data
publication_identifier:
  issn:
  - 2836-6573
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Soft and Constrained Hypertree Width
type: journal_article
user_id: '114410'
volume: 3
year: '2025'
...
---
_id: '60497'
abstract:
- lang: eng
  text: Despite the advantages that the virtual knowledge graph paradigm has brought
    to many application domains, state-of-the-art systems still do not support popular
    graph database management systems like Neo4j. Their query rewriting algorithms
    focus on languages like conjunctive queries and their unions, which were developed
    for relational data and are poorly suited for graph data. Moreover, they also
    limit the expressiveness of the ontology languages that admit rewritings, restricting
    them to those that enjoy the so-called FO-rewritability property. Rewritings have
    thus focused on the DL-Lite family of Description Logics. In this paper, we propose
    a technique for rewriting a family of navigational queries for a suitably tailored
    fragment of ELHI. Leveraging navigational features in the target query language,
    we can include some widely-used axiom shapes not supported by DL-Lite. We implemented
    a proof-of-concept prototype that rewrites into Cypher queries, and tested it
    on a real-world cognitive neuroscience use case with promising results.
author:
- first_name: Bianca
  full_name: Löhnert, Bianca
  last_name: Löhnert
- first_name: Nikolaus
  full_name: Augsten, Nikolaus
  last_name: Augsten
- first_name: Cem
  full_name: Okulmus, Cem
  id: '114410'
  last_name: Okulmus
  orcid: 0000-0002-7742-0439
- first_name: Magdalena
  full_name: Ortiz, Magdalena
  last_name: Ortiz
citation:
  ama: 'Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting
    Graph Queries Beyond DL-Lite. In: <i>The Semantic Web - 22nd European Semantic
    Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings,
    Part {I}</i>. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland;
    2025:342--361. doi:<a href="https://doi.org/10.1007/978-3-031-94575-5_19">10.1007/978-3-031-94575-5_19</a>'
  apa: Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Towards Practicable
    Algorithms for Rewriting Graph Queries Beyond DL-Lite. <i>The Semantic Web - 22nd
    European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025,
    Proceedings, Part {I}</i>, <i>15718</i>, 342--361. <a href="https://doi.org/10.1007/978-3-031-94575-5_19">https://doi.org/10.1007/978-3-031-94575-5_19</a>
  bibtex: '@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, series={Lecture Notes
    in Computer Science}, title={Towards Practicable Algorithms for Rewriting Graph
    Queries Beyond DL-Lite}, volume={15718}, DOI={<a href="https://doi.org/10.1007/978-3-031-94575-5_19">10.1007/978-3-031-94575-5_19</a>},
    booktitle={The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025,
    Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}, publisher={Springer
    Nature Switzerland}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus,
    Cem and Ortiz, Magdalena}, year={2025}, pages={342--361}, collection={Lecture
    Notes in Computer Science} }'
  chicago: Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards
    Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In <i>The
    Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia,
    June 1-5, 2025, Proceedings, Part {I}</i>, 15718:342--361. Lecture Notes in Computer
    Science. Springer Nature Switzerland, 2025. <a href="https://doi.org/10.1007/978-3-031-94575-5_19">https://doi.org/10.1007/978-3-031-94575-5_19</a>.
  ieee: 'B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms
    for Rewriting Graph Queries Beyond DL-Lite,” in <i>The Semantic Web - 22nd European
    Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings,
    Part {I}</i>, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: <a href="https://doi.org/10.1007/978-3-031-94575-5_19">10.1007/978-3-031-94575-5_19</a>.'
  mla: Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph
    Queries Beyond DL-Lite.” <i>The Semantic Web - 22nd European Semantic Web Conference,
    {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, vol.
    15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:<a href="https://doi.org/10.1007/978-3-031-94575-5_19">10.1007/978-3-031-94575-5_19</a>.
  short: 'B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: The Semantic Web - 22nd
    European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025,
    Proceedings, Part {I}, Springer Nature Switzerland, 2025, pp. 342--361.'
conference:
  end_date: 2025-06-05
  location: Portorož, Slovenia
  name: 22th European Semantic Web Conference (ESWC 2025)
  start_date: 2025-06-01
date_created: 2025-07-02T11:46:06Z
date_updated: 2025-07-02T11:55:19Z
department:
- _id: '888'
doi: 10.1007/978-3-031-94575-5_19
intvolume: '     15718'
keyword:
- Ontology-based Data Access
- Property Graphs
- Navigational Queries
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2405.18181
oa: '1'
page: 342--361
publication: The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025,
  Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}
publication_identifier:
  isbn:
  - '9783031945748'
  - '9783031945755'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite
type: conference
user_id: '114410'
volume: 15718
year: '2025'
...
---
_id: '61471'
author:
- first_name: Guido
  full_name: Governatori, Guido
  last_name: Governatori
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Governatori G, Turhan A-Y. Introduction to the Special Issue on Logic Rules
    and Reasoning: Selected Papers From the 6th International Joint Conference on
    Rules and Reasoning (RuleML+RR 2022). <i>Theory Pract Log Program</i>. 2025;25(2):132–133.
    doi:<a href="https://doi.org/10.1017/S1471068425000079">10.1017/S1471068425000079</a>'
  apa: 'Governatori, G., &#38; Turhan, A.-Y. (2025). Introduction to the Special Issue
    on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
    Conference on Rules and Reasoning (RuleML+RR 2022). <i>Theory Pract. Log. Program.</i>,
    <i>25</i>(2), 132–133. <a href="https://doi.org/10.1017/S1471068425000079">https://doi.org/10.1017/S1471068425000079</a>'
  bibtex: '@article{Governatori_Turhan_2025, title={Introduction to the Special Issue
    on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
    Conference on Rules and Reasoning (RuleML+RR 2022)}, volume={25}, DOI={<a href="https://doi.org/10.1017/S1471068425000079">10.1017/S1471068425000079</a>},
    number={2}, journal={Theory Pract. Log. Program.}, author={Governatori, Guido
    and Turhan, Anni-Yasmin}, year={2025}, pages={132–133} }'
  chicago: 'Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special
    Issue on Logic Rules and Reasoning: Selected Papers From the 6th International
    Joint Conference on Rules and Reasoning (RuleML+RR 2022).” <i>Theory Pract. Log.
    Program.</i> 25, no. 2 (2025): 132–133. <a href="https://doi.org/10.1017/S1471068425000079">https://doi.org/10.1017/S1471068425000079</a>.'
  ieee: 'G. Governatori and A.-Y. Turhan, “Introduction to the Special Issue on Logic
    Rules and Reasoning: Selected Papers From the 6th International Joint Conference
    on Rules and Reasoning (RuleML+RR 2022),” <i>Theory Pract. Log. Program.</i>,
    vol. 25, no. 2, pp. 132–133, 2025, doi: <a href="https://doi.org/10.1017/S1471068425000079">10.1017/S1471068425000079</a>.'
  mla: 'Governatori, Guido, and Anni-Yasmin Turhan. “Introduction to the Special Issue
    on Logic Rules and Reasoning: Selected Papers From the 6th International Joint
    Conference on Rules and Reasoning (RuleML+RR 2022).” <i>Theory Pract. Log. Program.</i>,
    vol. 25, no. 2, 2025, pp. 132–133, doi:<a href="https://doi.org/10.1017/S1471068425000079">10.1017/S1471068425000079</a>.'
  short: G. Governatori, A.-Y. Turhan, Theory Pract. Log. Program. 25 (2025) 132–133.
date_created: 2025-09-30T07:58:55Z
date_updated: 2025-09-30T08:02:13Z
department:
- _id: '888'
doi: 10.1017/S1471068425000079
intvolume: '        25'
issue: '2'
language:
- iso: eng
page: 132–133
publication: Theory Pract. Log. Program.
status: public
title: 'Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers
  From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)'
type: journal_article
user_id: '117185'
volume: 25
year: '2025'
...
---
_id: '61874'
abstract:
- lang: eng
  text: "<jats:p>\r\n            We study descriptive complexity of counting complexity
    classes in the range from #P to\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n
    \             <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n
    \           </jats:inline-formula>\r\n            . The proof of Fagin’s characterization
    of NP by existential second-order logic generalizes to the counting setting in
    the following sense: The class #P can be logically described as the class of functions
    counting satisfying assignments to free relation variables in first-order formulae.
    This was first observed by Saluja et al. (1995). In this paper we extend this
    study to classes beyond #P and extensions of first-order logic with team semantics.
    These team-based logics are closely related to existential second-order logic
    and its fragments, hence our results also shed light on the complexity of counting
    for extensions of first-order logic in Tarski’s semantics. Our results show that
    the class\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math
    notation=\"LaTeX\" version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n
    \           </jats:inline-formula>\r\n            can be logically characterized
    by independence logic and existential second-order logic, whereas dependence logic
    and inclusion logic give rise to subclasses of\r\n            <jats:inline-formula
    content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\"
    version=\"MathJax\">\\({\\text{#}\\!\\cdot\\!\\text{NP}}\\)</jats:tex-math>\r\n
    \           </jats:inline-formula>\r\n            and #P , respectively. We further
    relate the class obtained from inclusion logic to the complexity class\r\n            <jats:inline-formula
    content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\"
    version=\"MathJax\">\\({\\text{TotP}} \\subseteq{\\text{#P}}\\)</jats:tex-math>\r\n
    \           </jats:inline-formula>\r\n            .\r\n          </jats:p>"
article_number: '3771721'
author:
- first_name: Anselm
  full_name: Haak, Anselm
  id: '109969'
  last_name: Haak
- first_name: Juha
  full_name: Kontinen, Juha
  last_name: Kontinen
- first_name: Fabian
  full_name: Müller, Fabian
  last_name: Müller
- first_name: Heribert
  full_name: Vollmer, Heribert
  last_name: Vollmer
- first_name: Fan
  full_name: Yang, Fan
  last_name: Yang
citation:
  ama: Haak A, Kontinen J, Müller F, Vollmer H, Yang F. Counting of Teams in First-Order
    Team Logics. <i>ACM Transactions on Computational Logic</i>. Published online
    2025. doi:<a href="https://doi.org/10.1145/3771721">10.1145/3771721</a>
  apa: Haak, A., Kontinen, J., Müller, F., Vollmer, H., &#38; Yang, F. (2025). Counting
    of Teams in First-Order Team Logics. <i>ACM Transactions on Computational Logic</i>,
    Article 3771721. <a href="https://doi.org/10.1145/3771721">https://doi.org/10.1145/3771721</a>
  bibtex: '@article{Haak_Kontinen_Müller_Vollmer_Yang_2025, title={Counting of Teams
    in First-Order Team Logics}, DOI={<a href="https://doi.org/10.1145/3771721">10.1145/3771721</a>},
    number={3771721}, journal={ACM Transactions on Computational Logic}, publisher={Association
    for Computing Machinery (ACM)}, author={Haak, Anselm and Kontinen, Juha and Müller,
    Fabian and Vollmer, Heribert and Yang, Fan}, year={2025} }'
  chicago: Haak, Anselm, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang.
    “Counting of Teams in First-Order Team Logics.” <i>ACM Transactions on Computational
    Logic</i>, 2025. <a href="https://doi.org/10.1145/3771721">https://doi.org/10.1145/3771721</a>.
  ieee: 'A. Haak, J. Kontinen, F. Müller, H. Vollmer, and F. Yang, “Counting of Teams
    in First-Order Team Logics,” <i>ACM Transactions on Computational Logic</i>, Art.
    no. 3771721, 2025, doi: <a href="https://doi.org/10.1145/3771721">10.1145/3771721</a>.'
  mla: Haak, Anselm, et al. “Counting of Teams in First-Order Team Logics.” <i>ACM
    Transactions on Computational Logic</i>, 3771721, Association for Computing Machinery
    (ACM), 2025, doi:<a href="https://doi.org/10.1145/3771721">10.1145/3771721</a>.
  short: A. Haak, J. Kontinen, F. Müller, H. Vollmer, F. Yang, ACM Transactions on
    Computational Logic (2025).
date_created: 2025-10-17T09:43:42Z
date_updated: 2025-10-17T09:44:06Z
department:
- _id: '888'
doi: 10.1145/3771721
language:
- iso: eng
publication: ACM Transactions on Computational Logic
publication_identifier:
  issn:
  - 1529-3785
  - 1557-945X
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Counting of Teams in First-Order Team Logics
type: journal_article
user_id: '109969'
year: '2025'
...
---
_id: '55479'
author:
- first_name: Rafael
  full_name: Peñaloza, Rafael
  last_name: Peñaloza
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  last_name: Turhan
citation:
  ama: 'Peñaloza R, Turhan A-Y. Reasoning in Rough Description Logics with Multiple
    Indiscernibility Relations. In: Kirrane S, Simkus M, Soylu A, Roman D, eds. <i>Rules
    and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>.
    LNCS. Springer; 2024. doi:<a href="https://doi.org/10.1007/978-3-031-72407-7\_11">10.1007/978-3-031-72407-7\_11</a>'
  apa: Peñaloza, R., &#38; Turhan, A.-Y. (2024). Reasoning in Rough Description Logics
    with Multiple Indiscernibility Relations. In S. Kirrane, M. Simkus, A. Soylu,
    &#38; D. Roman (Eds.), <i>Rules and Reasoning - Eighth International Joint Conference,
    RuleML+RR 2024, Proceedings</i>. Springer. <a href="https://doi.org/10.1007/978-3-031-72407-7\_11">https://doi.org/10.1007/978-3-031-72407-7\_11</a>
  bibtex: '@inproceedings{Peñaloza_Turhan_2024, series={LNCS}, title={Reasoning in
    Rough Description Logics with Multiple Indiscernibility Relations}, DOI={<a href="https://doi.org/10.1007/978-3-031-72407-7\_11">10.1007/978-3-031-72407-7\_11</a>},
    booktitle={Rules and Reasoning - Eighth International Joint Conference, RuleML+RR
    2024, Proceedings}, publisher={Springer}, author={Peñaloza, Rafael and Turhan,
    Anni-Yasmin}, editor={Kirrane, Sabrina and Simkus, Mantas and Soylu, Ahmet and
    Roman, Dumitru}, year={2024}, collection={LNCS} }'
  chicago: Peñaloza, Rafael, and Anni-Yasmin Turhan. “Reasoning in Rough Description
    Logics with Multiple Indiscernibility Relations.” In <i>Rules and Reasoning -
    Eighth International Joint Conference, RuleML+RR 2024, Proceedings</i>, edited
    by Sabrina Kirrane, Mantas Simkus, Ahmet Soylu, and Dumitru Roman. LNCS. Springer,
    2024. <a href="https://doi.org/10.1007/978-3-031-72407-7\_11">https://doi.org/10.1007/978-3-031-72407-7\_11</a>.
  ieee: 'R. Peñaloza and A.-Y. Turhan, “Reasoning in Rough Description Logics with
    Multiple Indiscernibility Relations,” in <i>Rules and Reasoning - Eighth International
    Joint Conference, RuleML+RR 2024, Proceedings</i>, 2024, doi: <a href="https://doi.org/10.1007/978-3-031-72407-7\_11">10.1007/978-3-031-72407-7\_11</a>.'
  mla: Peñaloza, Rafael, and Anni-Yasmin Turhan. “Reasoning in Rough Description Logics
    with Multiple Indiscernibility Relations.” <i>Rules and Reasoning - Eighth International
    Joint Conference, RuleML+RR 2024, Proceedings</i>, edited by Sabrina Kirrane et
    al., Springer, 2024, doi:<a href="https://doi.org/10.1007/978-3-031-72407-7\_11">10.1007/978-3-031-72407-7\_11</a>.
  short: 'R. Peñaloza, A.-Y. Turhan, in: S. Kirrane, M. Simkus, A. Soylu, D. Roman
    (Eds.), Rules and Reasoning - Eighth International Joint Conference, RuleML+RR
    2024, Proceedings, Springer, 2024.'
date_created: 2024-08-01T12:30:48Z
date_updated: 2024-10-11T08:42:39Z
department:
- _id: '888'
doi: 10.1007/978-3-031-72407-7\_11
editor:
- first_name: Sabrina
  full_name: Kirrane, Sabrina
  last_name: Kirrane
- first_name: Mantas
  full_name: Simkus, Mantas
  last_name: Simkus
- first_name: Ahmet
  full_name: Soylu, Ahmet
  last_name: Soylu
- first_name: Dumitru
  full_name: Roman, Dumitru
  last_name: Roman
language:
- iso: eng
publication: Rules and Reasoning - Eighth International Joint Conference, RuleML+RR
  2024, Proceedings
publisher: Springer
series_title: LNCS
status: public
title: Reasoning in Rough Description Logics with Multiple Indiscernibility Relations
type: conference
user_id: '104470'
year: '2024'
...
---
_id: '56158'
author:
- first_name: Oliver Fernández
  full_name: Gil, Oliver Fernández
  last_name: Gil
- first_name: Fabio
  full_name: Patrizi, Fabio
  last_name: Patrizi
- first_name: Giuseppe
  full_name: Perelli, Giuseppe
  last_name: Perelli
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge
    Bases (Extended Abstract). In: Giordano L, Jung JC, Ozaki A, eds. <i>Proceedings
    of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway,
    June 18-21, 2024</i>. Vol 3739. CEUR Workshop Proceedings. CEUR-WS.org; 2024.'
  apa: Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2024). Optimal Alignment
    of Temporal Knowledge Bases (Extended Abstract). In L. Giordano, J. C. Jung, &#38;
    A. Ozaki (Eds.), <i>Proceedings of the 37th International Workshop on Description
    Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i> (Vol. 3739). CEUR-WS.org.
  bibtex: '@inproceedings{Gil_Patrizi_Perelli_Turhan_2024, series={CEUR Workshop Proceedings},
    title={Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)}, volume={3739},
    booktitle={Proceedings of the 37th International Workshop on Description Logics
    (DL 2024), Bergen, Norway, June 18-21, 2024}, publisher={CEUR-WS.org}, author={Gil,
    Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin},
    editor={Giordano, Laura and Jung, Jean Christoph and Ozaki, Ana}, year={2024},
    collection={CEUR Workshop Proceedings} }'
  chicago: Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin
    Turhan. “Optimal Alignment of Temporal Knowledge Bases (Extended Abstract).” In
    <i>Proceedings of the 37th International Workshop on Description Logics (DL 2024),
    Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano, Jean Christoph
    Jung, and Ana Ozaki, Vol. 3739. CEUR Workshop Proceedings. CEUR-WS.org, 2024.
  ieee: O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of
    Temporal Knowledge Bases (Extended Abstract),” in <i>Proceedings of the 37th International
    Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>,
    2024, vol. 3739.
  mla: Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases
    (Extended Abstract).” <i>Proceedings of the 37th International Workshop on Description
    Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>, edited by Laura Giordano
    et al., vol. 3739, CEUR-WS.org, 2024.
  short: 'O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, in: L. Giordano, J.C. Jung,
    A. Ozaki (Eds.), Proceedings of the 37th International Workshop on Description
    Logics (DL 2024), Bergen, Norway, June 18-21, 2024, CEUR-WS.org, 2024.'
date_created: 2024-09-17T08:45:01Z
date_updated: 2024-10-14T08:03:03Z
department:
- _id: '888'
editor:
- first_name: Laura
  full_name: Giordano, Laura
  last_name: Giordano
- first_name: Jean Christoph
  full_name: Jung, Jean Christoph
  last_name: Jung
- first_name: Ana
  full_name: Ozaki, Ana
  last_name: Ozaki
intvolume: '      3739'
language:
- iso: eng
publication: Proceedings of the 37th International Workshop on Description Logics
  (DL 2024), Bergen, Norway, June 18-21, 2024
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)
type: conference
user_id: '15504'
volume: 3739
year: '2024'
...
---
_id: '56159'
author:
- first_name: Rafael
  full_name: Peñaloza, Rafael
  last_name: Peñaloza
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Peñaloza R, Turhan A-Y. Rough, Rougher, Roughest: Extending EL with a Hierarchy
    of Indiscernibility Relations. In: Giordano L, Jung JC, Ozaki A, eds. <i>Proceedings
    of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway,
    June 18-21, 2024</i>. Vol 3739. CEUR Workshop Proceedings. CEUR-WS.org; 2024.'
  apa: 'Peñaloza, R., &#38; Turhan, A.-Y. (2024). Rough, Rougher, Roughest: Extending
    EL with a Hierarchy of Indiscernibility Relations. In L. Giordano, J. C. Jung,
    &#38; A. Ozaki (Eds.), <i>Proceedings of the 37th International Workshop on Description
    Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i> (Vol. 3739). CEUR-WS.org.'
  bibtex: '@inproceedings{Peñaloza_Turhan_2024, series={CEUR Workshop Proceedings},
    title={Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility
    Relations}, volume={3739}, booktitle={Proceedings of the 37th International Workshop
    on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024}, publisher={CEUR-WS.org},
    author={Peñaloza, Rafael and Turhan, Anni-Yasmin}, editor={Giordano, Laura and
    Jung, Jean Christoph and Ozaki, Ana}, year={2024}, collection={CEUR Workshop Proceedings}
    }'
  chicago: 'Peñaloza, Rafael, and Anni-Yasmin Turhan. “Rough, Rougher, Roughest: Extending
    EL with a Hierarchy of Indiscernibility Relations.” In <i>Proceedings of the 37th
    International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21,
    2024</i>, edited by Laura Giordano, Jean Christoph Jung, and Ana Ozaki, Vol. 3739.
    CEUR Workshop Proceedings. CEUR-WS.org, 2024.'
  ieee: 'R. Peñaloza and A.-Y. Turhan, “Rough, Rougher, Roughest: Extending EL with
    a Hierarchy of Indiscernibility Relations,” in <i>Proceedings of the 37th International
    Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024</i>,
    2024, vol. 3739.'
  mla: 'Peñaloza, Rafael, and Anni-Yasmin Turhan. “Rough, Rougher, Roughest: Extending
    EL with a Hierarchy of Indiscernibility Relations.” <i>Proceedings of the 37th
    International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21,
    2024</i>, edited by Laura Giordano et al., vol. 3739, CEUR-WS.org, 2024.'
  short: 'R. Peñaloza, A.-Y. Turhan, in: L. Giordano, J.C. Jung, A. Ozaki (Eds.),
    Proceedings of the 37th International Workshop on Description Logics (DL 2024),
    Bergen, Norway, June 18-21, 2024, CEUR-WS.org, 2024.'
date_created: 2024-09-17T08:46:26Z
date_updated: 2025-05-28T06:50:50Z
department:
- _id: '888'
editor:
- first_name: Laura
  full_name: Giordano, Laura
  last_name: Giordano
- first_name: Jean Christoph
  full_name: Jung, Jean Christoph
  last_name: Jung
- first_name: Ana
  full_name: Ozaki, Ana
  last_name: Ozaki
intvolume: '      3739'
language:
- iso: eng
publication: Proceedings of the 37th International Workshop on Description Logics
  (DL 2024), Bergen, Norway, June 18-21, 2024
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: 'Rough, Rougher, Roughest: Extending EL with a Hierarchy of Indiscernibility
  Relations'
type: conference
user_id: '117185'
volume: 3739
year: '2024'
...
---
_id: '52861'
author:
- first_name: Oliver Fernández
  full_name: Gil, Oliver Fernández
  last_name: Gil
- first_name: Fabio
  full_name: Patrizi, Fabio
  last_name: Patrizi
- first_name: Giuseppe
  full_name: Perelli, Giuseppe
  last_name: Perelli
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge
    Bases. <i>CoRR</i>. 2023;abs/2307.15439. doi:<a href="https://doi.org/10.48550/ARXIV.2307.15439">10.48550/ARXIV.2307.15439</a>
  apa: Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2023). Optimal Alignment
    of Temporal Knowledge Bases. <i>CoRR</i>, <i>abs/2307.15439</i>. <a href="https://doi.org/10.48550/ARXIV.2307.15439">https://doi.org/10.48550/ARXIV.2307.15439</a>
  bibtex: '@article{Gil_Patrizi_Perelli_Turhan_2023, title={Optimal Alignment of Temporal
    Knowledge Bases}, volume={abs/2307.15439}, DOI={<a href="https://doi.org/10.48550/ARXIV.2307.15439">10.48550/ARXIV.2307.15439</a>},
    journal={CoRR}, author={Gil, Oliver Fernández and Patrizi, Fabio and Perelli,
    Giuseppe and Turhan, Anni-Yasmin}, year={2023} }'
  chicago: Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin
    Turhan. “Optimal Alignment of Temporal Knowledge Bases.” <i>CoRR</i> abs/2307.15439
    (2023). <a href="https://doi.org/10.48550/ARXIV.2307.15439">https://doi.org/10.48550/ARXIV.2307.15439</a>.
  ieee: 'O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of
    Temporal Knowledge Bases,” <i>CoRR</i>, vol. abs/2307.15439, 2023, doi: <a href="https://doi.org/10.48550/ARXIV.2307.15439">10.48550/ARXIV.2307.15439</a>.'
  mla: Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases.”
    <i>CoRR</i>, vol. abs/2307.15439, 2023, doi:<a href="https://doi.org/10.48550/ARXIV.2307.15439">10.48550/ARXIV.2307.15439</a>.
  short: O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, CoRR abs/2307.15439 (2023).
date_created: 2024-03-25T13:58:27Z
date_updated: 2024-03-25T13:59:45Z
department:
- _id: '888'
doi: 10.48550/ARXIV.2307.15439
language:
- iso: eng
publication: CoRR
status: public
title: Optimal Alignment of Temporal Knowledge Bases
type: journal_article
user_id: '9503'
volume: abs/2307.15439
year: '2023'
...
---
_id: '52913'
author:
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Turhan A-Y. Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint
    DL+NMR Invited Talk). In: Kutz O, Lutz C, Ozaki A, eds. <i>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)., Rhodes, Greece, September 2-4, 2023</i>. Vol 3515. CEUR Workshop
    Proceedings. CEUR-WS.org; 2023.'
  apa: Turhan, A.-Y. (2023). Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk). In O. Kutz, C. Lutz, &#38; A. Ozaki (Eds.), <i>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)., Rhodes, Greece, September 2-4, 2023</i> (Vol. 3515). CEUR-WS.org.
  bibtex: '@inproceedings{Turhan_2023, series={CEUR Workshop Proceedings}, title={Brushing-up
    DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)}, volume={3515},
    booktitle={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)., Rhodes, Greece, September 2-4,
    2023}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin}, editor={Kutz, Oliver
    and Lutz, Carsten and Ozaki, Ana}, year={2023}, collection={CEUR Workshop Proceedings}
    }'
  chicago: Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk).” In <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, edited by Oliver Kutz, Carsten Lutz, and Ana Ozaki, Vol.
    3515. CEUR Workshop Proceedings. CEUR-WS.org, 2023.
  ieee: A.-Y. Turhan, “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint
    DL+NMR Invited Talk),” in <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, 2023, vol. 3515.
  mla: Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk).” <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, edited by Oliver Kutz et al., vol. 3515, CEUR-WS.org,
    2023.
  short: 'A.-Y. Turhan, 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 and the 21st International Workshop on Non-Monotonic Reasoning {(KR}
    2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023, CEUR-WS.org, 2023.'
date_created: 2024-03-26T10:50:16Z
date_updated: 2024-03-26T10:50:47Z
department:
- _id: '888'
editor:
- first_name: Oliver
  full_name: Kutz, Oliver
  last_name: Kutz
- first_name: Carsten
  full_name: Lutz, Carsten
  last_name: Lutz
- first_name: Ana
  full_name: Ozaki, Ana
  last_name: Ozaki
intvolume: '      3515'
language:
- iso: eng
publication: 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)., Rhodes, Greece, September 2-4, 2023
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited
  Talk)
type: conference
user_id: '9503'
volume: 3515
year: '2023'
...
---
_id: '54997'
author:
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  last_name: Turhan
citation:
  ama: 'Turhan A-Y. Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint
    DL+NMR Invited Talk). In: Kutz O, Lutz C, Ozaki A, eds. <i>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)., Rhodes, Greece, September 2-4, 2023</i>. Vol 3515. CEUR Workshop
    Proceedings. CEUR-WS.org; 2023.'
  apa: Turhan, A.-Y. (2023). Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk). In O. Kutz, C. Lutz, &#38; A. Ozaki (Eds.), <i>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)., Rhodes, Greece, September 2-4, 2023</i> (Vol. 3515). CEUR-WS.org.
  bibtex: '@inproceedings{Turhan_2023, series={CEUR Workshop Proceedings}, title={Brushing-up
    DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)}, volume={3515},
    booktitle={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)., Rhodes, Greece, September 2-4,
    2023}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin}, editor={Kutz, Oliver
    and Lutz, Carsten and Ozaki, Ana}, year={2023}, collection={CEUR Workshop Proceedings}
    }'
  chicago: Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk).” In <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, edited by Oliver Kutz, Carsten Lutz, and Ana Ozaki, Vol.
    3515. CEUR Workshop Proceedings. CEUR-WS.org, 2023.
  ieee: A.-Y. Turhan, “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint
    DL+NMR Invited Talk),” in <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, 2023, vol. 3515.
  mla: Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract
    of Joint DL+NMR Invited Talk).” <i>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)., Rhodes, Greece,
    September 2-4, 2023</i>, edited by Oliver Kutz et al., vol. 3515, CEUR-WS.org,
    2023.
  short: 'A.-Y. Turhan, 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 and the 21st International Workshop on Non-Monotonic Reasoning {(KR}
    2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023, CEUR-WS.org, 2023.'
date_created: 2024-07-03T09:09:00Z
date_updated: 2024-08-01T11:17:17Z
department:
- _id: '888'
editor:
- first_name: Oliver
  full_name: Kutz, Oliver
  last_name: Kutz
- first_name: Carsten
  full_name: Lutz, Carsten
  last_name: Lutz
- first_name: Ana
  full_name: Ozaki, Ana
  last_name: Ozaki
intvolume: '      3515'
language:
- iso: eng
publication: 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)., Rhodes, Greece, September 2-4, 2023
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited
  Talk)
type: conference
user_id: '9503'
volume: 3515
year: '2023'
...
---
_id: '56096'
author:
- first_name: Oliver Fernández
  full_name: Gil, Oliver Fernández
  last_name: Gil
- first_name: Fabio
  full_name: Patrizi, Fabio
  last_name: Patrizi
- first_name: Giuseppe
  full_name: Perelli, Giuseppe
  last_name: Perelli
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge
    Bases. In: Gal K, Nowé A, Nalepa GJ, Fairstein R, Radulescu R, eds. <i>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)</i>. Vol 372. Frontiers in Artificial Intelligence
    and Applications. IOS Press; 2023:708–715. doi:<a href="https://doi.org/10.3233/FAIA230335">10.3233/FAIA230335</a>'
  apa: Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2023). Optimal Alignment
    of Temporal Knowledge Bases. In K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, &#38;
    R. Radulescu (Eds.), <i>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)</i> (Vol. 372, pp.
    708–715). IOS Press. <a href="https://doi.org/10.3233/FAIA230335">https://doi.org/10.3233/FAIA230335</a>
  bibtex: '@inproceedings{Gil_Patrizi_Perelli_Turhan_2023, series={Frontiers in Artificial
    Intelligence and Applications}, title={Optimal Alignment of Temporal Knowledge
    Bases}, volume={372}, DOI={<a href="https://doi.org/10.3233/FAIA230335">10.3233/FAIA230335</a>},
    booktitle={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)}, publisher={IOS Press}, author={Gil,
    Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin},
    editor={Gal, Kobi and Nowé, Ann and Nalepa, Grzegorz J. and Fairstein, Roy and
    Radulescu, Roxana}, year={2023}, pages={708–715}, collection={Frontiers in Artificial
    Intelligence and Applications} }'
  chicago: Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin
    Turhan. “Optimal Alignment of Temporal Knowledge Bases.” In <i>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)</i>, edited by Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy
    Fairstein, and Roxana Radulescu, 372:708–715. Frontiers in Artificial Intelligence
    and Applications. IOS Press, 2023. <a href="https://doi.org/10.3233/FAIA230335">https://doi.org/10.3233/FAIA230335</a>.
  ieee: 'O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of
    Temporal Knowledge Bases,” in <i>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)</i>,
    2023, vol. 372, pp. 708–715, doi: <a href="https://doi.org/10.3233/FAIA230335">10.3233/FAIA230335</a>.'
  mla: Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases.”
    <i>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)</i>, edited by Kobi Gal et al.,
    vol. 372, IOS Press, 2023, pp. 708–715, doi:<a href="https://doi.org/10.3233/FAIA230335">10.3233/FAIA230335</a>.
  short: 'O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, in: K. Gal, A. Nowé, G.J.
    Nalepa, R. Fairstein, R. Radulescu (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),
    IOS Press, 2023, pp. 708–715.'
date_created: 2024-09-10T12:33:40Z
date_updated: 2024-09-25T09:25:40Z
department:
- _id: '888'
doi: 10.3233/FAIA230335
editor:
- first_name: Kobi
  full_name: Gal, Kobi
  last_name: Gal
- first_name: Ann
  full_name: Nowé, Ann
  last_name: Nowé
- first_name: Grzegorz J.
  full_name: Nalepa, Grzegorz J.
  last_name: Nalepa
- first_name: Roy
  full_name: Fairstein, Roy
  last_name: Fairstein
- first_name: Roxana
  full_name: Radulescu, Roxana
  last_name: Radulescu
intvolume: '       372'
language:
- iso: eng
page: 708–715
publication: 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)
publisher: IOS Press
series_title: Frontiers in Artificial Intelligence and Applications
status: public
title: Optimal Alignment of Temporal Knowledge Bases
type: conference
user_id: '15504'
volume: 372
year: '2023'
...
---
_id: '52859'
author:
- first_name: Igor
  full_name: de Camargo e Souza Câmara, Igor
  last_name: de Camargo e Souza Câmara
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: "de Camargo e Souza Câmara I, Turhan A-Y. Deciding Subsumption in Defeasible
    \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models. In: <i>Logics in Artificial
    Intelligence</i>. Springer Nature Switzerland; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>"
  apa: "de Camargo e Souza Câmara, I., &#38; Turhan, A.-Y. (2023). Deciding Subsumption
    in Defeasible \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models. In <i>Logics
    in Artificial Intelligence</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">https://doi.org/10.1007/978-3-031-43619-2_36</a>"
  bibtex: "@inbook{de Camargo e Souza Câmara_Turhan_2023, place={Cham}, title={Deciding
    Subsumption in Defeasible \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models},
    DOI={<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>},
    booktitle={Logics in Artificial Intelligence}, publisher={Springer Nature Switzerland},
    author={de Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}, year={2023}
    }"
  chicago: "Camargo e Souza Câmara, Igor de, and Anni-Yasmin Turhan. “Deciding Subsumption
    in Defeasible \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models.” In <i>Logics
    in Artificial Intelligence</i>. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">https://doi.org/10.1007/978-3-031-43619-2_36</a>."
  ieee: "I. de Camargo e Souza Câmara and A.-Y. Turhan, “Deciding Subsumption in Defeasible
    \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models,” in <i>Logics in Artificial
    Intelligence</i>, Cham: Springer Nature Switzerland, 2023."
  mla: "de Camargo e Souza Câmara, Igor, and Anni-Yasmin Turhan. “Deciding Subsumption
    in Defeasible \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality Models.” <i>Logics
    in Artificial Intelligence</i>, Springer Nature Switzerland, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-43619-2_36\">10.1007/978-3-031-43619-2_36</a>."
  short: 'I. de Camargo e Souza Câmara, A.-Y. Turhan, in: Logics in Artificial Intelligence,
    Springer Nature Switzerland, Cham, 2023.'
date_created: 2024-03-25T13:56:30Z
date_updated: 2024-12-11T13:57:36Z
department:
- _id: '888'
doi: 10.1007/978-3-031-43619-2_36
language:
- iso: eng
place: Cham
publication: Logics in Artificial Intelligence
publication_identifier:
  isbn:
  - '9783031436185'
  - '9783031436192'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: "Deciding Subsumption in Defeasible \U0001D4D4\U0001D4DB\U0001D4D8⊥ with Typicality
  Models"
type: book_chapter
user_id: '15504'
year: '2023'
...
---
_id: '52862'
author:
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Turhan A-Y. A Double Take at Conferences: The Hybrid Format. <i>KI - Künstliche
    Intelligenz</i>. 2022;36(1):1-4. doi:<a href="https://doi.org/10.1007/s13218-022-00758-6">10.1007/s13218-022-00758-6</a>'
  apa: 'Turhan, A.-Y. (2022). A Double Take at Conferences: The Hybrid Format. <i>KI
    - Künstliche Intelligenz</i>, <i>36</i>(1), 1–4. <a href="https://doi.org/10.1007/s13218-022-00758-6">https://doi.org/10.1007/s13218-022-00758-6</a>'
  bibtex: '@article{Turhan_2022, title={A Double Take at Conferences: The Hybrid Format},
    volume={36}, DOI={<a href="https://doi.org/10.1007/s13218-022-00758-6">10.1007/s13218-022-00758-6</a>},
    number={1}, journal={KI - Künstliche Intelligenz}, publisher={Springer Science
    and Business Media LLC}, author={Turhan, Anni-Yasmin}, year={2022}, pages={1–4}
    }'
  chicago: 'Turhan, Anni-Yasmin. “A Double Take at Conferences: The Hybrid Format.”
    <i>KI - Künstliche Intelligenz</i> 36, no. 1 (2022): 1–4. <a href="https://doi.org/10.1007/s13218-022-00758-6">https://doi.org/10.1007/s13218-022-00758-6</a>.'
  ieee: 'A.-Y. Turhan, “A Double Take at Conferences: The Hybrid Format,” <i>KI -
    Künstliche Intelligenz</i>, vol. 36, no. 1, pp. 1–4, 2022, doi: <a href="https://doi.org/10.1007/s13218-022-00758-6">10.1007/s13218-022-00758-6</a>.'
  mla: 'Turhan, Anni-Yasmin. “A Double Take at Conferences: The Hybrid Format.” <i>KI
    - Künstliche Intelligenz</i>, vol. 36, no. 1, Springer Science and Business Media
    LLC, 2022, pp. 1–4, doi:<a href="https://doi.org/10.1007/s13218-022-00758-6">10.1007/s13218-022-00758-6</a>.'
  short: A.-Y. Turhan, KI - Künstliche Intelligenz 36 (2022) 1–4.
date_created: 2024-03-25T14:00:30Z
date_updated: 2024-03-26T10:52:36Z
department:
- _id: '888'
doi: 10.1007/s13218-022-00758-6
intvolume: '        36'
issue: '1'
keyword:
- Artificial Intelligence
language:
- iso: eng
page: 1-4
publication: KI - Künstliche Intelligenz
publication_identifier:
  issn:
  - 0933-1875
  - 1610-1987
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: 'A Double Take at Conferences: The Hybrid Format'
type: journal_article
user_id: '9503'
volume: 36
year: '2022'
...
---
_id: '52923'
author:
- first_name: Igor
  full_name: de Camargo e Souza Câmara, Igor
  last_name: de Camargo e Souza Câmara
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'de Camargo e Souza Câmara I, Turhan A-Y. Rational Defeasible Subsumption in
    DLs with Nested Quantifiers: the Case of ELI\(\perp\). In: Arieli O, Casini G,
    Giordano L, eds. <i>Proceedings of the 20th International Workshop on Non-Monotonic
    Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa,
    Israel, August 7-9, 2022</i>. Vol 3197. CEUR Workshop Proceedings. CEUR-WS.org;
    2022:159–162.'
  apa: 'de Camargo e Souza Câmara, I., &#38; Turhan, A.-Y. (2022). Rational Defeasible
    Subsumption in DLs with Nested Quantifiers: the Case of ELI\(\perp\). In O. Arieli,
    G. Casini, &#38; L. Giordano (Eds.), <i>Proceedings of the 20th International
    Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference
    (FLoC 2022), Haifa, Israel, August 7-9, 2022</i> (Vol. 3197, pp. 159–162). CEUR-WS.org.'
  bibtex: '@inproceedings{de Camargo e Souza Câmara_Turhan_2022, series={CEUR Workshop
    Proceedings}, title={Rational Defeasible Subsumption in DLs with Nested Quantifiers:
    the Case of ELI\(\perp\)}, volume={3197}, booktitle={Proceedings of the 20th International
    Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference
    (FLoC 2022), Haifa, Israel, August 7-9, 2022}, publisher={CEUR-WS.org}, author={de
    Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}, editor={Arieli, Ofer and
    Casini, Giovanni and Giordano, Laura}, year={2022}, pages={159–162}, collection={CEUR
    Workshop Proceedings} }'
  chicago: 'Camargo e Souza Câmara, Igor de, and Anni-Yasmin Turhan. “Rational Defeasible
    Subsumption in DLs with Nested Quantifiers: The Case of ELI\(\perp\).” In <i>Proceedings
    of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part
    of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>,
    edited by Ofer Arieli, Giovanni Casini, and Laura Giordano, 3197:159–162. CEUR
    Workshop Proceedings. CEUR-WS.org, 2022.'
  ieee: 'I. de Camargo e Souza Câmara and A.-Y. Turhan, “Rational Defeasible Subsumption
    in DLs with Nested Quantifiers: the Case of ELI\(\perp\),” in <i>Proceedings of
    the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of
    the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>,
    2022, vol. 3197, pp. 159–162.'
  mla: 'de Camargo e Souza Câmara, Igor, and Anni-Yasmin Turhan. “Rational Defeasible
    Subsumption in DLs with Nested Quantifiers: The Case of ELI\(\perp\).” <i>Proceedings
    of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part
    of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022</i>,
    edited by Ofer Arieli et al., vol. 3197, CEUR-WS.org, 2022, pp. 159–162.'
  short: 'I. de Camargo e Souza Câmara, A.-Y. Turhan, in: O. Arieli, G. Casini, L.
    Giordano (Eds.), Proceedings of the 20th International Workshop on Non-Monotonic
    Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa,
    Israel, August 7-9, 2022, CEUR-WS.org, 2022, pp. 159–162.'
date_created: 2024-03-26T10:54:06Z
date_updated: 2024-03-26T10:56:19Z
department:
- _id: '888'
editor:
- first_name: Ofer
  full_name: Arieli, Ofer
  last_name: Arieli
- first_name: Giovanni
  full_name: Casini, Giovanni
  last_name: Casini
- first_name: Laura
  full_name: Giordano, Laura
  last_name: Giordano
intvolume: '      3197'
language:
- iso: eng
page: 159–162
publication: Proceedings of the 20th International Workshop on Non-Monotonic Reasoning,
  NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August
  7-9, 2022
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: 'Rational Defeasible Subsumption in DLs with Nested Quantifiers: the Case of
  ELI\(\perp\)'
type: conference
user_id: '9503'
volume: 3197
year: '2022'
...
---
_id: '52925'
citation:
  ama: Governatori G, Turhan A-Y, eds. <i>Rules and Reasoning - 6th International
    Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin, Germany, September
    26-28, 2022, Proceedings</i>. Vol 13752. Springer; 2022. doi:<a href="https://doi.org/10.1007/978-3-031-21541-4">10.1007/978-3-031-21541-4</a>
  apa: Governatori, G., &#38; Turhan, A.-Y. (Eds.). (2022). <i>Rules and Reasoning
    - 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin,
    Germany, September 26-28, 2022, Proceedings</i> (Vol. 13752). Springer. <a href="https://doi.org/10.1007/978-3-031-21541-4">https://doi.org/10.1007/978-3-031-21541-4</a>
  bibtex: '@book{Governatori_Turhan_2022, series={Lecture Notes in Computer Science},
    title={Rules and Reasoning - 6th International Joint Conference on Rules and Reasoning,
    RuleML+RR 2022, Berlin, Germany, September 26-28, 2022, Proceedings}, volume={13752},
    DOI={<a href="https://doi.org/10.1007/978-3-031-21541-4">10.1007/978-3-031-21541-4</a>},
    publisher={Springer}, year={2022}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Governatori, Guido, and Anni-Yasmin Turhan, eds. <i>Rules and Reasoning
    - 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin,
    Germany, September 26-28, 2022, Proceedings</i>. Vol. 13752. Lecture Notes in
    Computer Science. Springer, 2022. <a href="https://doi.org/10.1007/978-3-031-21541-4">https://doi.org/10.1007/978-3-031-21541-4</a>.
  ieee: G. Governatori and A.-Y. Turhan, Eds., <i>Rules and Reasoning - 6th International
    Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin, Germany, September
    26-28, 2022, Proceedings</i>, vol. 13752. Springer, 2022.
  mla: Governatori, Guido, and Anni-Yasmin Turhan, editors. <i>Rules and Reasoning
    - 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin,
    Germany, September 26-28, 2022, Proceedings</i>. Springer, 2022, doi:<a href="https://doi.org/10.1007/978-3-031-21541-4">10.1007/978-3-031-21541-4</a>.
  short: G. Governatori, A.-Y. Turhan, eds., Rules and Reasoning - 6th International
    Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin, Germany, September
    26-28, 2022, Proceedings, Springer, 2022.
date_created: 2024-03-26T10:54:33Z
date_updated: 2024-03-26T10:56:14Z
department:
- _id: '888'
doi: 10.1007/978-3-031-21541-4
editor:
- first_name: Guido
  full_name: Governatori, Guido
  last_name: Governatori
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
intvolume: '     13752'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-031-21540-7
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Rules and Reasoning - 6th International Joint Conference on Rules and Reasoning,
  RuleML+RR 2022, Berlin, Germany, September 26-28, 2022, Proceedings
type: conference_editor
user_id: '9503'
volume: 13752
year: '2022'
...