| Publication | Date of Publication | Type |
|---|
| Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures | 2026-02-19 | Paper |
| Finite-cliquewidth sets of existential rules: toward a general criterion for decidable yet highly expressive querying | 2024-10-08 | Paper |
| Explaining data with formal concept analysis | 2024-03-14 | Paper |
| To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence (Experiments) | 2024-01-12 | Dataset |
How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
The Journal of Artificial Intelligence Research (JAIR) | 2023-12-20 | Paper |
| Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets | 2023-07-17 | Paper |
Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
Rules and Reasoning | 2023-06-28 | Paper |
| Decidability of Querying First-Order Theories via Countermodels of Finite Width | 2023-04-13 | Paper |
| Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying | 2022-09-06 | Paper |
| scientific article; zbMATH DE number 7561463 (Why is no real title available?) | 2022-07-21 | Paper |
| Visualization of statistical information in concept lattice diagrams | 2022-03-21 | Paper |
Satisfiability and query answering in description logics with global and local cardinality constraints
(available as arXiv preprint) | 2021-07-06 | Paper |
| On Logics and Homomorphism Closure | 2021-04-24 | Paper |
On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
Journal of Artificial Intelligence Research | 2021-01-22 | Paper |
| Finite Model Theory of the Triguarded Fragment and Related Logics | 2021-01-20 | Paper |
| Datalog-Expressibility for Monadic and Guarded Second-Order Logic | 2020-10-12 | Paper |
| Preserving constraints with the stable chase | 2020-08-06 | Paper |
| Temporally attributed description logics | 2020-06-04 | Paper |
| Presburger concept cardinality constraints in very expressive description logics. Allegro sexagenarioso ma non ritardando | 2020-06-04 | Paper |
The triguarded fragment of first-order logic
EPiC Series in Computing | 2019-07-04 | Paper |
Preface: Concept lattices and applications: recent advances and new opportunities
Discrete Applied Mathematics | 2018-10-23 | Paper |
| scientific article; zbMATH DE number 6902546 (Why is no real title available?) | 2018-07-12 | Paper |
| Mixing materialization and query rewriting for existential rules | 2017-07-18 | Paper |
Revisiting grounded circumscription in description logics
Web Reasoning and Rule Systems | 2017-06-20 | Paper |
| scientific article; zbMATH DE number 6697177 (Why is no real title available?) | 2017-03-27 | Paper |
Succinctness and tractability of closure operator representations
Theoretical Computer Science | 2017-02-06 | Paper |
| ExpExpExplosion: uniform interpolation in general \(\mathcal{EL}\) terminologies | 2015-12-11 | Paper |
Complexities of Horn description logics
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Towards a navigation paradigm for triadic concepts
Formal Concept Analysis | 2015-06-16 | Paper |
What is a reasonable argumentation semantics?
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation | 2015-02-04 | Paper |
The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
Journal of Artificial Intelligence Research | 2015-01-14 | Paper |
(Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
Artificial Intelligence | 2014-08-01 | Paper |
On the succinctness of closure operator representations
Formal Concept Analysis | 2014-06-24 | Paper |
Some Notes on Managing Closure Operators
Formal Concept Analysis | 2012-09-10 | Paper |
Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
Logical Methods in Computer Science | 2012-04-03 | Paper |
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research | 2010-11-10 | Paper |
Using FCA for Encoding Closure Operators into Neural Networks
Conceptual Structures: Knowledge Architectures for Smart Applications | 2009-03-06 | Paper |
Cheap Boolean Role Constructors for Description Logics
Logics in Artificial Intelligence | 2008-10-27 | Paper |
Lexico-Logical Acquisition of OWL DL Axioms
Formal Concept Analysis | 2008-03-04 | Paper |
Acquiring Generalized Domain-Range Restrictions
Formal Concept Analysis | 2008-03-04 | Paper |
Some Notes on Pseudo-closed Sets
Formal Concept Analysis | 2007-09-03 | Paper |
Conceptual Structures at Work
Lecture Notes in Computer Science | 2005-08-26 | Paper |
| scientific article; zbMATH DE number 1808290 (Why is no real title available?) | 2002-09-26 | Paper |
