pl. Uniwersytecki
Zainteresowania
- logic
- mathematics
- computer science
- satisfiability
- complexity
- open access
- computational complexity
- description logics
- satisfiability problem
- artificial intelligence
Dyscyplina naukowa
- informatyka
Najnowsze publikacje
- All-instances oblivious chase termination is undecidable for single-head binary TGDs
- Why propositional quantification makes modal logics on trees robustly hard?
- Modal logics with composition on finite forests: expressivity and complexity
- Worst-case optimal querying of very expressive description logics with path expressions and succinct counting
- A framework for reasoning about dynamic axioms in description logics
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of ALC
- Completing the picture: complexity of graded modal logics with converse
- Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment
- On the limits of decision: the adjacent fragment of first-order logic
- On the complexity of graded modal logics with converse
- Satisfiability and query answering in description logics with global and local cardinality constraints
- Towards a model theory of ordered logics: expressivity and interpolation
- Beyond ALCreg : exploring non-regular extensions of PDL with description logics features
- “Most of” leads to undecidability: failure of adding frequencies to LTL
- On composing finite forests with modal logics
- One-variable logic meets Presburger arithmetic
- Why does propositional quantification make modal and temporal logics on trees robustly hard?
- Comonadic semantics for description logic games
- Statistical EL is ExpTime-complete
- Exploring non-regular extensions of propositional dynamic logic with description-logics features
