13 citations · 17 across the 16 of their papers we have counts for
4 papers · 1 filter
Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics
Bartosz Bednarczyk
We present a unified approach to (both finite and unrestricted) worst-case optimal entailment of (unions of) conjunctive queries (U)CQs in the wide class of "locally-forward" descr…
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics
Bartosz Bednarczyk, Maja Orłowska, Anna Pacanowska +1
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment…
The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard
Bartosz Bednarczyk, Sebastian Rudolph
In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest. For knowledge bases i…
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Bartosz Bednarczyk, Stéphane Demri
Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) adm…