1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.LO2026
Constructive Preference Relations: Navigating Undecidability in Rational LTL Contraction
Hannes GaiÃer, Dominik Klumpp, Jandson S. Ribeiro
We study the computational aspects of epistemic preference relations in non-classical logics, particularly linear temporal logic (LTL). Epistemic preferences form the backbone of b…
cs.PL2026★ 1 cited
On the Complexity of Checking Soundness of Natural Reductions (Extended Version)
Constantin Enea, Azadeh Farzan, Dominik Klumpp
The verification of reductions, representative subsets of interleavings, simplifies correctness proofs of parameterized concurrent programs. We introduce an expressive class of syn…
cs.LO2025
Effective AGM Belief Contraction: A Journey beyond the Finitary Realm (Technical Report)
Dominik Klumpp, Jandson S. Ribeiro
Despite significant efforts towards extending the AGM paradigm of belief change beyond finitary logics, the computational aspects of AGM have remained almost untouched. We investig…