International Center for Computational Logic - Benutzerbeiträge [de]

Inproceedings3388/en

2024-07-19T13:10:45Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Inproceedings3388

#REDIRECT [[Inproceedings3388]]

Inproceedings3388

2024-07-19T13:10:44Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Piotr |ErsterAutorNachname=Ostropolski-Nalewaja |FurtherAuthors=Sebastian Rudolph }} {{Inproceedings |Referiert=1 |Title=The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules |To appear=1 |Year=2024 |Month=November |Booktitle=The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules }} {{Publikation Details |Download=KR…“

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Ostropolski-Nalewaja
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
|To appear=1
|Year=2024
|Month=November
|Booktitle=The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
}}
{{Publikation Details
|Download=KR 2024 Characterization of Decidability for RPQs Under TGDs-iccl.pdf
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
}}

Datei:KR 2024 Characterization of Decidability for RPQs Under TGDs-iccl.pdf

2024-07-19T13:10:00Z

Piotr Ostropolski-Nalewaja:

Generating molecule graphs from mass spectrometry results using Answer-Set-Programming/en

2024-03-25T14:26:44Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Generating molecule graphs from mass spectrometry results using Answer-Set-Programming

Generating molecule graphs from mass spectrometry results using Answer-Set-Programming

2024-03-25T14:26:44Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Generating molecule graphs from mass spectrometry results using Answer-Set-Programming |Beschreibung EN=Abstract: Mass spectrometry i…“

{{Veranstaltung
|Titel EN=Generating molecule graphs from mass spectrometry results using Answer-Set-Programming
|Beschreibung EN=Abstract: Mass spectrometry is a procedure to determine the exact composition of chemicals analytically. However, chemical properties heavily depend on the structure of the molecules. Therefore it is of interest, to find possible structure formulas matching a given sum formula. In contrast to prior works on this subject, we approach this problem with Answer-Set-Programming, instead of giving a complex imperative implementation. To this end, various problem encodings for the ASP-solver Clingo will be discussed. Avoiding the emission of isomorphic models, methods of introducing symmetry-breaking constraints will be compared. Their evaluation focuses on weighting the reduction in undetected isomorphic copies against runtime overhead. Different hand-crafted constraints - adjusted specially for this problem - will be compared against automated methods.

The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/03/28 11:00:00
|Ende=2024/03/28 12:00:00
|Raum=APB room 2026
|Vortragender=Nils Küchenmeister
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Answer Set Navigation alongside Quantitative Reasoning/en

2024-02-13T19:07:05Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Answer Set Navigation alongside Quantitative Reasoning

Answer Set Navigation alongside Quantitative Reasoning

2024-02-13T19:07:05Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Answer Set Navigation alongside Quantitative Reasoning |Beschreibung EN=Abstract: This is a so called status talk of PhD student Domi…“

{{Veranstaltung
|Titel EN=Answer Set Navigation alongside Quantitative Reasoning
|Beschreibung EN=Abstract: This is a so called status talk of PhD student Dominik Rusovac, supervised by Sarah Alice Gaggl. The main goal of the thesis is to study the concept of answer set navigation. Essentially, aiming at a systematic framework that consists of efficient and from the ground up characterised methods to deal with a large amount of answer sets (solutions) of a logic program (problem).

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/02/15 11:00:00
|Ende=2024/02/15 12:00:00
|Raum=APB room 3027
|Vortragender=Dominik Rusovac
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)/en

2024-02-02T15:56:47Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)

SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)

2024-02-02T15:56:47Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer) |Beschreibung EN=Abstract…“

{{Veranstaltung
|Titel EN=SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)
|Beschreibung EN=Abstract: SHACL is a widely used W3C standard to manage RDF data: it is used to express integrity constraints on "complete" data. These constraints may contain recursion and negation and many other kinds of exotic features, like counting over paths expressed by regular expressions. As SHACL is intended for validation over complete data, we add ontologies to the RDF data (and create a knowledge base) and ask what it means to combine both: we define validation of SHACL combined with ontologies as SHACL validation over the core chase of this knowledge base.

However, creating the core chase is not feasible in practice. To tackle this, we propose a way to build the core chase in a layer-by-layer manner, based on pre-calculated building blocks and without having to look for non-embedding endomorphisms, as the usual core construction does. We use these building blocks to rewrite SHACL validation in case of ontologies to plain SHACL validation.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/02/08 11:00:00
|Ende=2024/02/08 12:00:00
|Raum=APB room 3027
|Vortragender=Anouk Michelle Oudshoorn
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

ASYDE: An Argumentation-based System for classifYing Driving bEhaviors

2024-01-31T18:07:44Z

Piotr Ostropolski-Nalewaja:

{{Veranstaltung
|Titel EN=ASYDE: An Argumentation-based System for classifYing Driving bEhaviors
|Beschreibung EN=Abstract:
Examining the influence of human behavior on road safety is a matter of considerable interest. As
studies in this field have demonstrated a correlation between driver behavior and road safety over
the past decades, there is a compelling need to develop a software system capable of impartially
identifying the typical driving behavior of motorists. The objective of this research is to create one
or more algorithms capable of recognizing and classifying a driver's typical driving behavior by
integrating various data sources. Since different data sources may present conflicting information
due to noise errors or failures, our goal is to resolve such ambiguities by employing artificial
intelligence paradigms. We are currently exploring the potential use of a well-known AI framework,
namely Dung’s Abstract Argumentation Framework (AAF). Argumentation Frameworks, indeed,
provide a valuable tool for analyzing and assessing conflicting pieces of information, enabling us to
draw more accurate and dependable conclusions. Our argumentation-based system provides the
user with a driving certificate describing their driving behavior. In the certificate, we outline, for
each predefined class C of driving behavior (e.g., calm driving, normal driving, aggressive driving),
the minimum and maximum percentage of time points where the driving behavior falls in C. The
minimum percentage represents the time points where driver behavior has been classified in C
without uncertainty, whereas the maximum percentage encodes the time points where some other
classes in addition to C have been identified, allowing for multiple interpretations.
The experimental evaluation baked up the need for intervals, as for several time points ambiguity in
identifying classes occurred, due to different measures collected by different sensors leading to
conflicting information. Therefore, assigning a single class is not always possible; instead, multiple
possible interpretations need to be considered.

The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/02/01 11:00:00
|Ende=2024/02/01 12:00:00
|Raum=APB room 2026
|Vortragender=Giuseppina Monterosso
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

ASYDE: An Argumentation-based System for classifYing Driving bEhaviors

2024-01-29T14:28:23Z

Piotr Ostropolski-Nalewaja:

{{Veranstaltung
|Titel EN=ASYDE: An Argumentation-based System for classifYing Driving bEhaviors
|Beschreibung EN=Abstract:
Examining the influence of human behavior on road safety is a matter of considerable interest. As
studies in this field have demonstrated a correlation between driver behavior and road safety over
the past decades, there is a compelling need to develop a software system capable of impartially
identifying the typical driving behavior of motorists. The objective of this research is to create one
or more algorithms capable of recognizing and classifying a driver's typical driving behavior by
integrating various data sources. Since different data sources may present conflicting information
due to noise errors or failures, our goal is to resolve such ambiguities by employing artificial
intelligence paradigms. We are currently exploring the potential use of a well-known AI framework,
namely Dung’s Abstract Argumentation Framework (AAF). Argumentation Frameworks, indeed,
provide a valuable tool for analyzing and assessing conflicting pieces of information, enabling us to
draw more accurate and dependable conclusions. Our argumentation-based system provides the
user with a driving certificate describing their driving behavior. In the certificate, we outline, for
each predefined class C of driving behavior (e.g., calm driving, normal driving, aggressive driving),
the minimum and maximum percentage of time points where the driving behavior falls in C. The
minimum percentage represents the time points where driver behavior has been classified in C
without uncertainty, whereas the maximum percentage encodes the time points where some other
classes in addition to C have been identified, allowing for multiple interpretations.
The experimental evaluation baked up the need for intervals, as for several time points ambiguity in
identifying classes occurred, due to different measures collected by different sensors leading to
conflicting information. Therefore, assigning a single class is not always possible; instead, multiple
possible interpretations need to be considered.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/02/01 11:00:00
|Ende=2024/02/01 12:00:00
|Raum=APB room 2026
|Vortragender=Giuseppina Monterosso
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

ASYDE: An Argumentation-based System for classifYing Driving bEhaviors/en

2024-01-29T13:57:15Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page ASYDE: An Argumentation-based System for classifYing Driving bEhaviors

ASYDE: An Argumentation-based System for classifYing Driving bEhaviors

2024-01-29T13:57:15Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=ASYDE: An Argumentation-based System for classifYing Driving bEhaviors |Beschreibung EN=Abstract: Examining the influence of human…“

{{Veranstaltung
|Titel EN=ASYDE: An Argumentation-based System for classifYing Driving bEhaviors
|Beschreibung EN=Abstract:
Examining the influence of human behavior on road safety is a matter of considerable interest. As
studies in this field have demonstrated a correlation between driver behavior and road safety over
the past decades, there is a compelling need to develop a software system capable of impartially
identifying the typical driving behavior of motorists. The objective of this research is to create one
or more algorithms capable of recognizing and classifying a driver's typical driving behavior by
integrating various data sources. Since different data sources may present conflicting information
due to noise errors or failures, our goal is to resolve such ambiguities by employing artificial
intelligence paradigms. We are currently exploring the potential use of a well-known AI framework,
namely Dung’s Abstract Argumentation Framework (AAF). Argumentation Frameworks, indeed,
provide a valuable tool for analyzing and assessing conflicting pieces of information, enabling us to
draw more accurate and dependable conclusions. Our argumentation-based system provides the
user with a driving certificate describing their driving behavior. In the certificate, we outline, for
each predefined class C of driving behavior (e.g., calm driving, normal driving, aggressive driving),
the minimum and maximum percentage of time points where the driving behavior falls in C. The
minimum percentage represents the time points where driver behavior has been classified in C
without uncertainty, whereas the maximum percentage encodes the time points where some other
classes in addition to C have been identified, allowing for multiple interpretations.
The experimental evaluation baked up the need for intervals, as for several time points ambiguity in
identifying classes occurred, due to different measures collected by different sensors leading to
conflicting information. Therefore, assigning a single class is not always possible; instead, multiple
possible interpretations need to be considered.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/02/01 11:00:00
|Ende=2024/02/01 12:00:00
|Raum=APB room 3027
|Vortragender=Giuseppina Monterosso
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

A Logic-based Reasoning Framework for Graph Databases/en

2024-01-17T13:34:44Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page A Logic-based Reasoning Framework for Graph Databases

A Logic-based Reasoning Framework for Graph Databases

2024-01-17T13:34:44Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=A Logic-based Reasoning Framework for Graph Databases |Beschreibung EN=In many scientific and industrial applications, graph database…“

{{Veranstaltung
|Titel EN=A Logic-based Reasoning Framework for Graph Databases
|Beschreibung EN=In many scientific and industrial applications, graph databases are gaining momentum thanks to the competitive performance they offer and their flexibility, not to mention their interpretability. Still, their uses remain somehow limited due to their lack of consistency-checking strategies. Here, I introduce a scheme-based access to data in order to assert constraints and keep consistency, while also opening possibilities for reasoning in logic-based approaches, in a multi-strategy setting. The possible uses and capabilities are still under investigation, but the potentialities in almost every domain seem to be promising.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/01/18 11:00:00
|Ende=2024/01/18 12:00:00
|Raum=APB room 3027
|Vortragender=Davide Di Pierro
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

PAC Completion of Description Logic TBoxes/en

2024-01-09T19:46:02Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page PAC Completion of Description Logic TBoxes

PAC Completion of Description Logic TBoxes

2024-01-09T19:46:02Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=PAC Completion of Description Logic TBoxes |Beschreibung EN=Abstract: In description logic knowledge bases, there may be a need to en…“

{{Veranstaltung
|Titel EN=PAC Completion of Description Logic TBoxes
|Beschreibung EN=Abstract: In description logic knowledge bases, there may be a need to ensure that the terminological part of the base is complete in the sense that it captures all relevant relations between concepts. In [1], a method was proposed that does this for a user-specified subset of concepts. The method is based on attribute exploration from formal concept analysis [2] and uses queries to acquire knowledge from a domain expert. It may however require an exponential (in the size of the output) number of queries. I will present a probably approximately correct version of the method based on an algorithm for learning propositional Horn formulas [3]. The method works for an arbitrary DL language allowing the bottom concept, conjunction, and negation.
This is a joint work with Barış Sertkaya (Frankfurt University of Applied Sciences).

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2024/01/11 11:00:00
|Ende=2024/01/11 12:00:00
|Raum=APB room 3027
|Vortragender=Sergei Obiedkov
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing/en

2023-12-08T18:15:49Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing

Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing

2023-12-08T18:15:48Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing |Beschreibung EN=Abstract: The emerging fie…“

{{Veranstaltung
|Titel EN=Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing
|Beschreibung EN=Abstract: The emerging field of food computing tackles, among others, problems of knowledge acquisition, modeling, and processing within the culinary domain. Food-related knowledge is often implicit, contextual, or culture-dependent. Making at least part of it explicit, with some formalization, opens up possibilities to develop intelligent knowledge-based solutions to assist humans in preparing and optimizing food. An interesting and relevant problem is searching for substitutions in food recipes, a task motivated by different constraints and goals of a person, and leveraging the knowledge of dieticians and/or food technologists.
Addressing this challenge, the following questions emerge: What is relevant knowledge when it comes to food recommendations and AI-based decision support for ingredient substitution? Is there space for knowledge-based systems in the age of large language models? How to formally represent and reason about diets, allergies, and other restrictions? What food-related knowledge graphs and ontologies are there and are they useful for practical applications?
In this seminar, I will share my experience from the TAISTI project (“Development of a Technology based on Artificial Intelligence for inferring SubsTitutable recipe Ingredients”, https://www.taisti.eu/), in particular ontology and knowledge graph engineering, and logical reasoning over integrated knowledge. Apart from practical challenges, I will also discuss interesting questions about the similarity of entities -- a problem that goes beyond the domain of food. I will present the entity set expansion problem and discuss recent proposals for formally describing the similarity of instances in knowledge bases and retrieving more entities ``of the same kind''.

Speaker bio: Weronika T. Adrian, Ph.D. (wta@agh.edu.pl, http://wtadrian.eu, http://kraken.edu.pl) is an Assistant Professor and the Deputy Head of the Department of Applied Computer Science, Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Kraków, Poland. Her research interests cover the theory and practice of semantic technologies, knowledge graphs, and logic programming. She (co-)authored nearly 70 publications in the field of AI. Obtained her Ph.D. in Mathematics and Computer Science from the University of Calabria (Italy), followed by a 2-year post-doctoral contract in the group of Prof. Nicola Leone. Dr. Adrian has been involved in multiple national and international R&D projects and EU programs. She is a laureate of the “Top 500 Innovators” scholarship at Stanford University (USA). Founder of Creativity and Innovation Lab Foundation, a founder member of the Polish Artificial Intelligence Society, and a former member of IEEE.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/12/14 11:00:00
|Ende=2023/12/14 12:00:00
|Raum=APB room 3027
|Vortragender=Weronika T. Adrian
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Notation3 as an Existential Rule Language/en

2023-11-14T07:19:56Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Notation3 as an Existential Rule Language

Notation3 as an Existential Rule Language

2023-11-14T07:19:56Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Notation3 as an Existential Rule Language |Beschreibung EN=Abstract: Notation3 Logic (N3) is an extension of RDF that allows the user…“

{{Veranstaltung
|Titel EN=Notation3 as an Existential Rule Language
|Beschreibung EN=Abstract: Notation3 Logic (N3) is an extension of RDF that allows the user to write rules introducing new blank nodes to RDF graphs. Many applications (e.g., ontology mapping) rely on this feature as blank nodes – used directly or in auxiliary constructs – are omnipresent on the Web. However, the number of fast N3 reasoners covering this very important feature of the logic is rather limited. On the other hand, there are engines like VLog or Nemo which do not directly support Semantic Web rule formats but which are developed and optimized for very similar constructs: existential rules. In this paper, we investigate the relation between N3 rules with blank nodes in their heads and existential rules. We identify a subset of N3 that can be mapped directly to existential rules and define such a mapping preserving the equivalence of N3 formulae. In order to also illustrate that in some cases N3 reasoning could benefit from our translation, we then employ this mapping in an implementation to compare the performance of the N3 reasoners EYE and cwm to VLog and Nemo on N3 rules and their mapped counterparts. Our tests show that the existential rule reasoners perform particularly well for use cases containing many facts while especially the EYE reasoner is very fast when dealing with a high number of dependent rules. We thus provide a tool enabling the Semantic Web community to directly use existing and future existential rule reasoners and benefit from the findings of this active community.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/11/16 11:00:00
|Ende=2023/11/16 12:00:00
|Raum=APB 3027
|Vortragender=Dörthe Arndt
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Abstract Domains for Database Manipulating Processes/en

2023-11-07T11:42:17Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Abstract Domains for Database Manipulating Processes

Abstract Domains for Database Manipulating Processes

2023-11-07T11:42:17Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Abstract Domains for Database Manipulating Processes |Beschreibung EN=Database manipulating systems (DMS) formalize operations on rel…“

{{Veranstaltung
|Titel EN=Abstract Domains for Database Manipulating Processes
|Beschreibung EN=Database manipulating systems (DMS) formalize operations on relational databases like adding new tuples or deleting existing ones. To ensure sufficient expressiveness for capturing practical database systems, DMS operations incorporate guarding expressions first-order formulas over countable value domains. Those features impose infinite state, infinitely branching processes thus making automated reasoning about properties like the reachability of states intractable. Most recent approaches, therefore, restrict DMS to obtain decidable fragments. Nevertheless, a comprehensive semantic framework capturing full DMS, yet incorporating effective notions of data abstraction and process equivalence is an open issue. In this paper, we propose DMS process semantics based on principles of abstract interpretation. The concrete domain consists of all valid databases, whereas the abstract domain employs different constructions for unifying sets of databases being semantically equivalent up to particular fragments of the DMS guard language. The connection between abstract and concrete domains is effectively established by homomorphic mappings whose properties and restrictions depend on the expressiveness of the DMS fragment under consideration. We instantiate our framework for canonical DMS fragments and investigate semantical preservation of abstractions up to bisimilarity, being one of the strongest equivalence notions for operational process semantics.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/11/09 11:00:00
|Ende=2023/11/09 12:00:00
|Raum=APB room 3027
|Vortragender=Stephan Mennicke
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying

2023-10-20T11:43:17Z

Piotr Ostropolski-Nalewaja:

{{Veranstaltung
|Titel EN=Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying
|Beschreibung EN=Abstract: The core chase, a popular algorithm for answering conjunctive queries (CQs) over existential rules, is guaranteed to terminate and compute a finite universal model whenever one exists, leading to the equivalence of the universal-model-based and the chase-based definitions of finite expansion sets (fes) – a class of rulesets featuring decidable CQ entailment. In case of non-termination, however, it is non-trivial to define a "result" of the core chase, due to its non-monotonicity. This causes complications when dealing with advanced decidability criteria based on the existence of (universal) models of finite treewidth. For these, sufficient chase-based conditions have only been established for weaker, monotonic chase variants.
This paper starts out from the – desirable and prima facie plausible – conjecture that the existence of a treewidth-bounded universal model and the existence of a treewidth-bounded core-chase sequence coincide – which would conveniently entail decidable CQ entailment whenever the latter holds. Perhaps surprisingly, carefully crafted examples show that both directions of this conjectured correspondence fail. On a positive note, we are still able to define an aggregation scheme for the infinite core chase that preserves treewidth bounds and produces a finitely universal model, i.e., one that satisfies exactly the entailed CQs. This allows us to prove that the existence of a treewidth-bounded core-chase sequence *does* warrant decidability of CQ entailment (yet, on other grounds than expected). Hence, for the first time, we are able to define a chase-based notion of bounded treewidth sets of rules that subsumes fes.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/11/02 11:00:00
|Ende=2023/11/02 12:00:00
|Raum=APB room 3027
|Vortragender=Sebastian Rudolph
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying/en

2023-10-20T11:28:07Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying

Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying

2023-10-20T11:28:07Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying |Beschreibung EN=Abstract:…“

{{Veranstaltung
|Titel EN=Bounded Treewidth and the Infinite Core Chase – Complications and Workarounds toward Decidable Querying
|Beschreibung EN=Abstract: The core chase, a popular algorithm for answering conjunctive queries (CQs) over existential rules, is guaranteed to terminate and compute a finite universal model whenever one exists, leading to the equivalence of the universal-model-based and the chase-based definitions of finite expansion sets (fes) – a class of rulesets featuring decidable CQ entailment. In case of non-termination, however, it is non-trivial to define a "result" of the core chase, due to its non-monotonicity. This causes complications when dealing with advanced decidability criteria based on the existence of (universal) models of finite treewidth. For these, sufficient chase-based conditions have only been established for weaker, monotonic chase variants.
This paper starts out from the – desirable and prima facie plausible – conjecture that the existence of a treewidth-bounded universal model and the existence of a treewidth-bounded core-chase sequence coincide – which would conveniently entail decidable CQ entailment whenever the latter holds. Perhaps surprisingly, carefully crafted examples show that both directions of this conjectured correspondence fail. On a positive note, we are still able to define an aggregation scheme for the infinite core chase that preserves treewidth bounds and produces a finitely universal model, i.e., one that satisfies exactly the entailed CQs. This allows us to prove that the existence of a treewidth-bounded core-chase sequence *does* warrant decidability of CQ entailment (yet, on other grounds than expected). Hence, for the first time, we are able to define a chase-based notion of bounded treewidth sets of rules that subsumes fes.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/10/26 11:00:00
|Ende=2023/10/26 12:00:00
|Raum=APB room 3027
|Vortragender=Sebastian Rudolph
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Knowledge graphs: description, validation and subsetting/en

2023-10-02T14:07:12Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Knowledge graphs: description, validation and subsetting

Knowledge graphs: description, validation and subsetting

2023-10-02T14:07:12Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Knowledge graphs: description, validation and subsetting |Beschreibung EN=Abstract: Knowledge graphs like Wikidata have reached great…“

{{Veranstaltung
|Titel EN=Knowledge graphs: description, validation and subsetting
|Beschreibung EN=Abstract: Knowledge graphs like Wikidata have reached great success in the representation and integration of vast amounts of information from different domains. The use of flexible data models, without predefined schemas facilitates the aggregation of data from heterogeneous sources. However, the lack of schemas also undermines the quality of the data available in knowledge graphs. Many times, data curators have an implicit schema that can describe the data and be used to check the conformance of the data. The Shape Expressions (ShEx) language was created with the goal to describe and validate RDF and was adopted by Wikidata in the Entity Schemas namespace. In this talk, we will briefly present the ShEx language and show some applications. More specifically, we will show how ShEx can be used to describe and generate Wikidata subsets, which can help the use of Wikidata as a research source.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/10/05 11:00:00
|Ende=2023/10/05 12:00:00
|Raum=APB room 3027
|Vortragender=Jose Emilio Labra Gayo
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Temporal reasoning with DatalogMTL

2023-09-18T13:09:21Z

Piotr Ostropolski-Nalewaja:

{{Veranstaltung
|Titel EN=Temporal reasoning with DatalogMTL
|Beschreibung EN=Abstract: During the talk, I will present DatalogMTL – an extension of Datalog with operators from metric temporal logic (MTL) – and our research on this formalism. DatalogMTL allows for performing complex temporal reasoning tasks over the rational timeline, which makes it suitable for many practical applications. However, performing the main reasoning tasks in this setting is computationally expensive, e.g., fact entailment is EXPSPACE-complete in combined and PSPACE-complete in data complexity. High complexity, together with the need of performing reasoning over infinite temporal structures, makes developing practical algorithms for DatalogMTL challenging. I will describe our approaches to address these difficulties, and discuss their experimental evaluation.

The talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/09/19 11:00:00
|Ende=2023/09/19 12:00:00
|Raum=APB room 2026
|Vortragender=Przemysław Wałęga
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Temporal reasoning with DatalogMTL

2023-09-18T13:08:48Z

Piotr Ostropolski-Nalewaja:

Temporal reasoning with DatalogMTL

2023-09-18T13:05:11Z

Piotr Ostropolski-Nalewaja:

{{Veranstaltung
|Titel EN=Temporal reasoning with DatalogMTL
|Beschreibung EN=During the talk, I will present DatalogMTL – an extension of
Datalog with operators from metric temporal logic (MTL) – and our
research on this formalism. DatalogMTL allows for performing complex
temporal reasoning tasks over the rational timeline, which makes it
suitable for many practical applications. However, performing the main
reasoning tasks in this setting is computationally expensive, e.g., fact
entailment is EXPSPACE-complete in combined and PSPACE-complete in data
complexity. High complexity, together with the need of performing
reasoning over infinite temporal structures, makes developing practical
algorithms for DatalogMTL challenging. I will describe our approaches to
address these difficulties, and discuss their experimental evaluation.
|Veranstaltungsart=Vortrag
|Start=2023/09/19 11:00:00
|Ende=2023/09/19 12:00:00
|Raum=APB room 2026
|Vortragender=Przemysław Wałęga
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Representative Answer Sets: Collecting Something of Everything/en

2023-09-11T15:15:51Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Representative Answer Sets: Collecting Something of Everything

Representative Answer Sets: Collecting Something of Everything

2023-09-11T15:15:51Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Representative Answer Sets: Collecting Something of Everything |Beschreibung EN=Title: Representative Answer Sets: Collecting Somethi…“

{{Veranstaltung
|Titel EN=Representative Answer Sets: Collecting Something of Everything
|Beschreibung EN=Title: Representative Answer Sets: Collecting Something of Everything

Abstract: Answer set programming (ASP) is a popular problem
solving paradigm with applications in planning and configuration.
In practice, the number of answer sets can be overwhelmingly high,
which naturally causes interest in a concise characterisation of the
solution space in terms of representative answer sets. We establish
a notion of representativeness that refers to the entropy of specified
target atoms within a collection of answer sets. Accordingly, we pro-
pose different approaches for collecting such representative answer
sets, based on answer set navigation. Finally, we conduct experi-
ments using our prototypical implementation, which reveals promis-
ing results.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/09/14 11:00:00
|Ende=2023/09/14 12:00:00
|Raum=APB room 3027
|Vortragender=Elisa Böhl
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Formalizing "Formale Systeme"/en

2023-08-25T15:50:22Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Formalizing "Formale Systeme"

Formalizing "Formale Systeme"

2023-08-25T15:50:22Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Formalizing "Formale Systeme" |Beschreibung EN=Abstract: In undergraduate theoretical computer science courses, students encounter m…“

{{Veranstaltung
|Titel EN=Formalizing "Formale Systeme"
|Beschreibung EN=Abstract: In undergraduate theoretical computer science courses, students
encounter many new concepts along with techniques to prove theorems
about those with mathematical rigour. Most of those definitions and
proofs are both constructive in nature and fairly self contained, since
they depend on only very few mathematical facts. This makes formalising
them in an automated theorem prover feasible and educational. The
objective of this project was to formalize a subset of the two lectures
"Formale Systeme" and "Theoretische Informatik und Logik", serving both
as a reference for students and as a starting point for future
formalisations.

The LEAN theorem prover and programming language is a project under
active development with a large, community maintained library of
mathematical definitions and theorems called "mathlib". This makes it a
good fit for formalising the undergraduate computer science lectures.
LEAN also incorporates interesting and convenient features, notably a
Haskell inspired type class resolution, a first-class support for
quotients and the ability to very easily extend the language with new
notations or tactics.

While there has already been some effort to formalizing "Formale
Systeme", most has been reimplemented to make the definitions easier to
work with, taking special care to end up with small and reusable proofs.
Overall the focus has been on regular languages, where the equivalence
of DFAs, NFAs and regular grammars among each other is the major
implemented result.

In this talk I will give a short introduction to LEAN and outline the
definitions and theorems that have been formalized as a part of this
project.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/08/31 11:00:00
|Ende=2023/08/31 12:00:00
|Raum=APB room 3027
|Vortragender=Matthias Meißner
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

On the Abstract Expressive Power of Description Logics with Concrete Domains/en

2023-08-21T10:41:47Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page On the Abstract Expressive Power of Description Logics with Concrete Domains

On the Abstract Expressive Power of Description Logics with Concrete Domains

2023-08-21T10:41:47Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=On the Abstract Expressive Power of Description Logics with Concrete Domains |Beschreibung EN=The talk will take place in a hybrid fa…“

{{Veranstaltung
|Titel EN=On the Abstract Expressive Power of Description Logics with Concrete Domains
|Beschreibung EN=The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus

Abstract: Concrete domains have been introduced in Description Logic (DL) to
enable reference to concrete objects (such as numbers) and predefined
predicates on these objects (such as numerical comparisons) when
defining concepts. The main emphasis of research in this context was on
finding restrictions on the concrete domain such that its integration
into certain DLs preserves decidability. In particular, it was shown
that ω-admissible concrete domains can be integrated into the DL ALC
without causing undecidability.

In this paper, we concentrate on investigating the expressive power of
DLs with concrete domains. Basically, their semantics is defined using
first-order interpretations as abstract domains extended with partial
functions from the abstract domain into the concrete domain.
The abstract expressive power of a given classical logic (first-order
logic or DL) extended with a concrete domain is determined by which
classes of first-order interpretations (i.e., abstract domains where we
forget the partial functions and their values) can be expressed.

To show that such a class is not first-order definable, one can try to
use a compactness argument, i.e., prove that first-order definability
would lead to a contradiction to compactness of first-order logic (FO).
In the first part of the paper, we will show that extensions of FO or
ALC with a homomorphism ω-compact concrete domain share many formal
properties with FO, such as the compactness and the downward
Löwenheim-Skolem property. Nevertheless, their abstract expressive power
need not be contained in that of FO. Note that any ω-admissible concrete
domain is homomorphism ω-compact.

In the second part of the paper, we investigate whether finitely-bounded
homogeneous structures, which preserve decidability if employed as
concrete domains, can be used to express certain universal first-order
sentences, which then could be added to knowledge bases without
destroying decidability. We will see that this requires rather strong
conditions on the universal first-order sentences or an extended scheme
for integrating the concrete domain.
|Veranstaltungsart=Vortrag
|Start=2023/08/24 11:00:00
|Ende=2023/08/24 12:00:00
|Raum=APB room 3027
|Vortragender=Filippo De Bortoli
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Temporal reasoning with DatalogMTL/en

2023-08-21T10:20:32Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Temporal reasoning with DatalogMTL

Temporal reasoning with DatalogMTL

2023-08-21T10:20:32Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Temporal reasoning with DatalogMTL |Beschreibung EN=During the talk, I will present DatalogMTL – an extension of Datalog with oper…“

{{Veranstaltung
|Titel EN=Temporal reasoning with DatalogMTL
|Beschreibung EN=During the talk, I will present DatalogMTL – an extension of
Datalog with operators from metric temporal logic (MTL) – and our
research on this formalism. DatalogMTL allows for performing complex
temporal reasoning tasks over the rational timeline, which makes it
suitable for many practical applications. However, performing the main
reasoning tasks in this setting is computationally expensive, e.g., fact
entailment is EXPSPACE-complete in combined and PSPACE-complete in data
complexity. High complexity, together with the need of performing
reasoning over infinite temporal structures, makes developing practical
algorithms for DatalogMTL challenging. I will describe our approaches to
address these difficulties, and discuss their experimental evaluation.
|Veranstaltungsart=Vortrag
|Start=2023/09/19 11:00:00
|Ende=2023/09/19 12:00:00
|Raum=APB room 3027
|Vortragender=Przemysław Wałęga
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination/en

2023-07-24T17:24:59Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination

Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination

2023-07-24T17:24:59Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination |Beschreibung EN=Abstract: The disjuncti…“

{{Veranstaltung
|Titel EN=Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination
|Beschreibung EN=Abstract: The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it does is undecidable. However, we can use acyclicity notions (sufficient conditions that imply termination) to effectively apply the chase in many real-world cases. To know if these conditions are as general as possible, we can use cyclicity notions (sufficient conditions that imply non-termination). In this paper, we discuss some issues with previously existing cyclicity notions, propose some novel notions for non-termination by dismantling the original idea, and empirically verify the generality of the new criteria.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/07/27 11:00:00
|Ende=2023/07/27 12:00:00
|Raum=APB room 3027
|Vortragender=Lukas Gerlach
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions./en

2023-07-10T09:48:47Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions.

How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions.

2023-07-10T09:48:47Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions. |Beschreibung EN…“

{{Veranstaltung
|Titel EN=How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions.
|Beschreibung EN=Abstract: We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by Löding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n ∈ N}. We establish undecidability of the satisfiability problem for ALC extended with nominals and r#s#, as well as the query entailment problem, where such non-regular atoms are present in queries.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/07/13 11:00:00
|Ende=2023/07/13 12:00:00
|Raum=APB room 3027
|Vortragender=Bartosz Bednarczyk
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence/en

2023-06-23T15:17:20Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence

To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence

2023-06-23T15:17:19Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence |Beschreibung EN=Abstract: Aggregating pieces of informat…“

{{Veranstaltung
|Titel EN=To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence
|Beschreibung EN=Abstract: Aggregating pieces of information or beliefs held by (abstract) agents is central to a variety of belief merging applications. When the merging process aims at retrieving an underlying ground truth, the Condorcet Jury Theorem (CJT) allows identifying voting rules that almost surely track the true piece of information for large groups of agents, given that specific conditions are met. As essential assumptions, the CJT relies on all agents being equally competent as well as independent from one another. In the search for a generalization of the CJT applicable to real-world scenarios, both aforementioned assumptions were weakened separately. In this work, we provide a generalization of the CJT that allows, at the same time, for heterogeneous competence levels across agents as well as a degree of dependence modeled through an opinion leader exerting influence on the electorate. Additionally, we derive a concrete bound on the number of agents necessary to successfully track the underlying ground truth, and examine the bound's tightness by means of statistical simulations.

The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:
https://bbb.tu-dresden.de/b/pio-zwt-smp-aus
|Veranstaltungsart=Vortrag
|Start=2023/06/29 11:00:00
|Ende=2023/06/09 12:00:00
|Raum=APB room 3027
|Vortragender=Jonas Karge
|Event series=Research Seminar Logic and AI
|In News anzeigen=1
}}

Piotr Ostropolski-Nalewaja

2023-06-13T13:45:03Z

Piotr Ostropolski-Nalewaja:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Ostropolski-Nalewaja
|Akademischer Titel=MSc
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+48 504609291
|Email=piotr.ostropolski-nalewaja@tu-dresden.de
|Raum=APB 2031
|Bild=Piotr.png
|Info=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|Info EN=I am a PhD student at the University of Wrocław and a researcher in the Computational Logic group at Technische Universität Dresden. I currently work within the ERC project DeciGUT, and my research interests concern topics within the fields of Logic, Database Theory, Knowledge Representation, and AI.
|DBLP=https://dblp.org/pid/195/6032.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Article3094

2023-06-13T13:41:27Z

Piotr Ostropolski-Nalewaja:

{{Publikation Erster Autor
|ErsterAutorVorname=Michael
|ErsterAutorNachname=Benedikt
|FurtherAuthors=Stanislav Kikot; Piotr Ostropolski-Nalewaja; Miguel Romero
}}
{{Article
|Referiert=0
|Title=On Monotonic Determinacy and Rewritability for Recursive Queries and Views
|To appear=0
|Year=2023
|Month=März
|Journal=ACM Trans. Comput. Logic
|Volume=24
|Number=2
}}
{{Publikation Details
|DOI Name=10.1145/3572836
|Forschungsgruppe=Computational Logic
}}

Article3094/en

2023-06-13T13:40:30Z

Piotr Ostropolski-Nalewaja: Page created automatically by parser function on page Article3094

#REDIRECT [[Article3094]]

Article3094

2023-06-13T13:40:30Z

Piotr Ostropolski-Nalewaja: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Michael |ErsterAutorNachname=Benedikt |FurtherAuthors=Piotr Ostropolski-Nalewaja }} {{Article |Referiert=0 |Titl…“

{{Publikation Erster Autor
|ErsterAutorVorname=Michael
|ErsterAutorNachname=Benedikt
|FurtherAuthors=Piotr Ostropolski-Nalewaja
}}
{{Article
|Referiert=0
|Title=On Monotonic Determinacy and Rewritability for Recursive Queries and Views
|To appear=0
|Year=2023
|Month=März
|Journal=ACM Trans. Comput. Logic
|Volume=24
|Number=2
}}
{{Publikation Details
|DOI Name=10.1145/3572836
|Forschungsgruppe=Computational Logic
}}

Inproceedings3358

2023-06-13T13:36:32Z

Piotr Ostropolski-Nalewaja:

{{Publikation Erster Autor
|ErsterAutorVorname=Jarosław
|ErsterAutorNachname=Kwiecień
|FurtherAuthors=Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja
}}
{{Inproceedings
|Referiert=1
|Title=Determinacy of Real Conjunctive Queries. The Boolean Case
|To appear=0
|Year=2022
|Booktitle=Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
|Pages=347–358
|Publisher=Association for Computing Machinery
}}
{{Publikation Details
|DOI Name=10.1145/3517804.3524168
|Forschungsgruppe=Computational Logic
}}