13 citations · 13 across the 2 of their papers we have counts for
3 papers
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari +1
We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic…
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
We introduce and investigate the expressive description logic (DL) ALCSCC++, in which the global and local cardinality constraints introduced in previous papers can be mixed. On th…
Modulo Counting on Words and Trees
Bartosz Bednarczyk, Witold Charatonik
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees.…