From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “dependence logic” 113

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Locality Theorems in Semiring Semantics
2023 arXiv (Cornell University) preprint Computer Science Advanced Algebra and Logic Open access

Clotilde Bizière, Erich Grädel, Matthias Naaf

0

citations
Automatically Finding the Right Probabilities in Bayesian Networks
2023 Journal of Artificial Intelligence Research article Computer Science Bayesian Modeling and Causal Inference Open access

Bahare Salmani, Joost-Pieter Katoen

8

citations
How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

A. Soeteman, Michael Benedikt, Martin Grohe, Balder ten Cate

0

citations
Enhancing the Effectiveness of Public Sector Performance Regimes: A Proposed Causal Model for Aligning Governance Design with Performance Logics
2023 Perspectives on Public Management and Governance article Social Sciences Public Policy and Administration Research Open access

Altaf Virani, Zeger van der Wal

34

citations
Towards Rule Extraction for Sector-Coupled Energy Systems Based on Optimization Models
2023 International Conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems (ECOS) conference-paper Engineering Integrated Energy Systems Optimization Open access

David Wackerbauer, Dirk Müller

1

citations
Gestaltungsrahmen zur reifegradbasierten Ableitung und Priorisierung der Circular-Economy-Strategie unter Unsicherheitsfaktoren für produzierende Unternehmen
2026 RWTH Publications (RWTH Aachen) dissertation Business, Management and Accounting Sustainable Supply Chain Management Open access

Dennis Kreutzer

0

citations
Controller Synthesis for Golog Programs over Finite Domains with Metric Temporal Constraints
2021 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Till Hofmann, Gerhard Lakemeyer

1

citations
Guarded Teams: The Horizontally Guarded Case
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, Reasoning, and Knowledge Open access

Erich Grädel, Martin Otto

1

citations
Ehrenfeucht-Fraïssé Games in Semiring Semantics
2023 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Sophie Brinke, Erich Grädel, Lovro Mrkonjić

0

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing

3

citations
An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
2022 AI Communications article Computer Science Logic, Reasoning, and Knowledge Open access

Loan Ho, Somjit Arch‐int, Erman Acar, Stefan Schlobach, Ngamnij Arch‐int

2

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

31

citations
Composition and Recursion for Causal Structures
2023 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, programming, and type systems Open access

3

citations
Proving Termination of C Programs with Lists
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

2

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Proving Termination of C Programs with Lists
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

1

citations
Automated Termination Proofs for C Programs with Lists (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

0

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

0

citations