The following pages link to Sebastian Rudolph (Q507521):
Displayed 38 items.
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Preface: Concept lattices and applications: recent advances and new opportunities (Q1800375) (← links)
- Visualization of statistical information in concept lattice diagrams (Q2117136) (← links)
- Temporally attributed description logics (Q2185484) (← links)
- Presburger concept cardinality constraints in very expressive description logics. Allegro sexagenarioso ma non ritardando (Q2185489) (← links)
- (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\) (Q2510119) (← links)
- Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog (Q2881079) (← links)
- Some Notes on Managing Closure Operators (Q2907475) (← links)
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases (Q2938475) (← links)
- Complexities of Horn Description Logics (Q2946686) (← links)
- (Q2970048) (← links)
- Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! (Q3055811) (← links)
- (Q3149780) (← links)
- Preserving Constraints with the Stable Chase (Q3305357) (← links)
- (Q3455591) (← links)
- Cheap Boolean Role Constructors for Description Logics (Q3532479) (← links)
- Some Notes on Pseudo-closed Sets (Q3590984) (← links)
- Using FCA for Encoding Closure Operators into Neural Networks (Q3608749) (← links)
- (Q4576215) (← links)
- On the Succinctness of Closure Operator Representations (Q4981121) (← links)
- (Q4999259) (← links)
- (Q5091112) (← links)
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics (Q5145833) (← links)
- What Is a Reasonable Argumentation Semantics? (Q5172623) (← links)
- The Triguarded Fragment of First-Order Logic (Q5222982) (← links)
- Towards a Navigation Paradigm for Triadic Concepts (Q5255663) (← links)
- Revisiting Grounded Circumscription in Description Logics (Q5268432) (← links)
- (Q5283050) (← links)
- Conceptual Structures at Work (Q5313112) (← links)
- Acquiring Generalized Domain-Range Restrictions (Q5445321) (← links)
- Lexico-Logical Acquisition of OWL DL Axioms (Q5445324) (← links)
- Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics (Q6104767) (← links)
- Datalog-Expressibility for Monadic and Guarded Second-Order Logic (Q6351071) (← links)
- Finite Model Theory of the Triguarded Fragment and Related Logics (Q6358696) (← links)
- On Logics and Homomorphism Closure (Q6366021) (← links)
- Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying (Q6409836) (← links)
- Decidability of Querying First-Order Theories via Countermodels of Finite Width (Q6432930) (← links)
- Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets (Q6444026) (← links)