International Center for Computational Logic - Letzte Änderungen [de]

Inproceedings3475

Sebastian Rudolph — Mon, 10 Aug 2026 13:07:07 GMT

← Nächstältere Version		Version vom 10. August 2026, 13:07 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 8:		Zeile 8:
	\|To appear=1		\|To appear=1
	\|Year=2026		\|Year=2026
	\|Booktitle=Conceptual Knowledge Structures		\|Booktitle=The Third International Joint Conference on Conceptual Knowledge Structures (CONCEPTS 2026)
	\|Publisher=Springer		\|Publisher=Springer
			\|Editor=Madalina Croitoru, Domingo López-Rodríguez, Gerd Stumme
	\|Series=LNCS		\|Series=LNCS
	\|Volume=16811		\|Volume=16811

Inproceedings3476

Lukas Gerlach — Mon, 10 Aug 2026 06:12:07 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Julián |ErsterAutorNachname=Méndez |FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Krötzsch; Raimund Dachselt }} {{Inproceedings |Referiert=1 |Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming |To appear=1 |Year=2026 |Booktitle=VIS 2026 }} {{Publikation Details |Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and bu…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Julián
|ErsterAutorNachname=Méndez
|FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Krötzsch; Raimund Dachselt
}}
{{Inproceedings
|Referiert=1
|Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming
|To appear=1
|Year=2026
|Booktitle=VIS 2026
}}
{{Publikation Details
|Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and builder for Nemo, a powerful Datalog reasoner with extended features. Our tools were developed with and for expert users. However, considering the lack of resources to learn Datalog and similar declarative logic programming languages, we conducted a qualitative user study to assess how our tools might help students. The study, interviewing 14 participants with varying levels of involvement with the content of a university course on knowledge graphs, revealed a very positive assessment of our tools, which strengthens the value of visual explanation tools beyond their intended use.
|Download=Nev-Short-Paper-VIS-2026.pdf
|Projekt=CPEC
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}

Datei:Nev-Short-Paper-VIS-2026.pdf

Lukas Gerlach — Mon, 10 Aug 2026 06:11:39 GMT

Lukas Gerlach lud Datei:Nev-Short-Paper-VIS-2026.pdf hoch

Neue Seite

TBA17

Meghna Bhadra — Sun, 09 Aug 2026 20:14:14 GMT

← Nächstältere Version		Version vom 9. August 2026, 20:14 Uhr
(3 dazwischenliegende Versionen derselben Benutzerin werden nicht angezeigt)
Zeile 1:		Zeile 1:
	{{Veranstaltung		{{Veranstaltung
	\|Titel DE=~~TBA~~		\|Titel DE=Logical Institutional and Narrative Dynamics
	\|Titel EN=~~TBA~~		\|Titel EN=Logical Institutional and Narrative Dynamics
	\|Beschreibung DE=~~TBA~~		\|Beschreibung DE=Human societies are full of heterogenous rule-based structures (norms and institutions) which coexist with each other temporally, but also evolve and transform over time under interaction, documented through primary sources. This presents a modelling challenge, since some generative social models (e.g. game-theoretic ones) compress textual data into simplified, temporally local theoretical assumptions while others use statistical learning over longer times but struggle to generate off-distribution outputs. Meanwhile decision-makers are increasingly interested in scenario models for fields such as privacy and systemic risks to democratic institutions. This student talk will present a proposal for a Master's thesis project, a generative agent-based model that is both data-driven and interactive in an interpretable way. The plan is to extract institutional transition dynamics from prosopographies - temporal KGs of named individuals. Additionally, agents would be equipped with personal narratives of rules and facts. Following the symbolic interactionism approach in sociology, these two elements will act as the rules and constraints under which the social KG evolves. Because all of these components can be expressed in one unified logical representation, the model can be tentatively used both to analyze documented structures (e.g. identifying communities via constraints) and generate counterfactuals to test hypotheses, without any encoding/decoding or collapse of concepts into scalars. Currently, similar work has been done to analyze privacy policies with ASP, but another consideration is Standpoint Logic.
	\|Beschreibung EN=~~TBA~~

			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
			\|Beschreibung EN=Human societies are full of heterogenous rule-based structures (norms and institutions) which coexist with each other temporally, but also evolve and transform over time under interaction, documented through primary sources. This presents a modelling challenge, since some generative social models (e.g. game-theoretic ones) compress textual data into simplified, temporally local theoretical assumptions while others use statistical learning over longer times but struggle to generate off-distribution outputs. Meanwhile decision-makers are increasingly interested in scenario models for fields such as privacy and systemic risks to democratic institutions. This student talk will present a proposal for a Master's thesis project, a generative agent-based model that is both data-driven and interactive in an interpretable way. The plan is to extract institutional transition dynamics from prosopographies - temporal KGs of named individuals. Additionally, agents would be equipped with personal narratives of rules and facts. Following the symbolic interactionism approach in sociology, these two elements will act as the rules and constraints under which the social KG evolves. Because all of these components can be expressed in one unified logical representation, the model can be tentatively used both to analyze documented structures (e.g. identifying communities via constraints) and generate counterfactuals to test hypotheses, without any encoding/decoding or collapse of concepts into scalars. Currently, similar work has been done to analyze privacy policies with ASP, but another consideration is Standpoint Logic.


			BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join.
	\|Veranstaltungsart=Vortrag		\|Veranstaltungsart=Vortrag
	\|Start=2026-08-13 11:00:00		\|Start=2026-08-13 11:00:00

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 13:32:53 GMT

← Nächstältere Version		Version vom 5. August 2026, 13:32 Uhr
(3 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 14:		Zeile 14:
	}}		}}
	{{Publikation Details		{{Publikation Details
	\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.		\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for "easy" ways to verify PCF.

	As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.		As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.
			\|Download=SR-Concepts2026.pdf
	\|Forschungsgruppe=Computational Logic		\|Forschungsgruppe=Computational Logic
	}}		}}

Datei:SR-Concepts2026.pdf

Sebastian Rudolph — Wed, 05 Aug 2026 00:11:42 GMT

Sebastian Rudolph lud Datei:SR-Concepts2026.pdf hoch

Neue Seite

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 00:10:23 GMT

← Nächstältere Version		Version vom 5. August 2026, 00:10 Uhr
(Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt)
Zeile 5:		Zeile 5:
	{{Inproceedings		{{Inproceedings
	\|Referiert=1		\|Referiert=1
	\|Title=Pseudo-Closed Family ~~Veri�fication~~ is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)		\|Title=Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
	\|To appear=1		\|To appear=1
	\|Year=2026		\|Year=2026
Zeile 14:		Zeile 14:
	}}		}}
	{{Publikation Details		{{Publikation Details
	\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis -- the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.		\|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.

	As the large language model Claude Opus 4.6 was instrumental in establishing the ~~\textsc{~~NP}-hardness part, this paper also discusses the methodology applied and observations made in the process.		As the large language model Claude Opus 4.6 was instrumental in establishing the NP-hardness part, this paper also discusses the methodology applied and observations made in the process.
	\|Forschungsgruppe=Computational Logic		\|Forschungsgruppe=Computational Logic
	}}		}}

Inproceedings3475

Sebastian Rudolph — Wed, 05 Aug 2026 00:09:21 GMT

Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Sebastian |ErsterAutorNachname=Rudolph }} {{Inproceedings |Referiert=1 |Title=Pseudo-Closed Family Veri�fication is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) |To appear=1 |Year=2026 |Booktitle=Conceptual Knowledge Structures |Publisher=Springer |Series=LNCS |Volume=16811 }} {{Publikation Details |Abstract=Every closure operator on a finite set admits a canonical minimum implication bas…“

Neue Seite

{{Publikation Erster Autor
|ErsterAutorVorname=Sebastian
|ErsterAutorNachname=Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Pseudo-Closed Family Veri�fication is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
|To appear=1
|Year=2026
|Booktitle=Conceptual Knowledge Structures
|Publisher=Springer
|Series=LNCS
|Volume=16811
}}
{{Publikation Details
|Abstract=Every closure operator on a finite set admits a canonical minimum implication basis -- the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove that PCF is NP-complete, negatively answering a question posed by Bernhard Ganter at CONCEPTS'25, which essentially asked for ``easy'' ways to verify PCF.

As the large language model Claude Opus 4.6 was instrumental in establishing the \textsc{NP}-hardness part, this paper also discusses the methodology applied and observations made in the process.
|Forschungsgruppe=Computational Logic
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Formale Begriffsanalyse
}}

Datei:ESWC2026-sparqling-datalog.pdf

Alex Ivliev — Tue, 04 Aug 2026 13:05:07 GMT

Alex Ivliev lud eine neue Version von Datei:ESWC2026-sparqling-datalog.pdf hoch Paper titled "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at ESWC 2026

Neue Seite

Full version of the paper "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at the European Semantic Web Conference 2026

Datei:ESWC2026-sparqling-datalog.pdf

Alex Ivliev — Tue, 04 Aug 2026 13:03:35 GMT

Alex Ivliev lud eine neue Version von Datei:ESWC2026-sparqling-datalog.pdf hoch Paper titled "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at ESWC 2026

Neue Seite

Full version of the paper "SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs" presented at the European Semantic Web Conference 2026

Datei:2608.00698.pdf

Martin Diller — Tue, 04 Aug 2026 10:00:04 GMT

Martin Diller lud Datei:2608.00698.pdf hoch

Neue Seite