2 citations · 3 across the 2 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2019
Dynamic Complexity Meets Parameterised Algorithms
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier +2
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formula…
cs.LO2017★ 2 cited
The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics
Ioannis Kokkinis
Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators…
cs.LO2017★ 1 cited
The Complexity of Probabilistic Justification Logic
Ioannis Kokkinis
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be us…