The following pages link to Franz Baader (Q171404):
Displaying 50 items.
- On the complexity of Boolean unification (Q293360) (← links)
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited (Q472810) (← links)
- The theory of idempotent semigroups is of unification type zero (Q581000) (← links)
- Unification in commutative theories (Q582071) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Restricted unification in the DL \(\mathcal{FL}_0\) (Q831925) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- Unification in varieties of idempotent semigroups (Q1092171) (← links)
- A note on unification type zero (Q1098285) (← links)
- Unification in commutative idempotent monoids (Q1111775) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations (Q1314281) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- Cardinality restrictions on concepts (Q1391904) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Description logics with aggregates and concrete domains. (Q1425804) (← links)
- A new description logic with set constraints and cardinality constraints on role successors (Q1687537) (← links)
- Metric temporal description logics with interval-rigid names (Q1687541) (← links)
- Using ontologies to query probabilistic numerical data (Q1687542) (← links)
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic (Q1896367) (← links)
- Unification in the union of disjoint equational theories: Combining decision procedures (Q1918503) (← links)
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification (Q1919702) (← links)
- An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
- Finding good proofs for description logic entailments using recursive quality measures (Q2055864) (← links)
- Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes (Q2055866) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
- Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
- Evonne: interactive proof visualization for description logics (system description) (Q2104515) (← links)
- The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\) (Q2180224) (← links)
- On the expressive power of description logics with cardinality constraints on finite and infinite sets (Q2180228) (← links)
- Privacy-preserving ontology publishing for \(\mathcal{EL}\) instance stores (Q2296715) (← links)
- Counting strategies for the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\) under the principle of maximum entropy (Q2296725) (← links)
- On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions (Q2341257) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- (Q2721180) (← links)
- (Q2751360) (← links)
- (Q2754237) (← links)
- (Q2762630) (← links)
- Unification in the Description Logic EL (Q2786134) (← links)
- Reasoning with Prototypes in the Description Logic $${\mathcal {ALC}}$$ ALC Using Weighted Tree Automata (Q2798710) (← links)
- Query and Predicate Emptiness in Ontology-Based Data Access (Q2805284) (← links)
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ (Q2835862) (← links)
- Verification of Golog Programs over Description Logic Actions (Q2849489) (← links)
- Hybrid Unification in the Description Logic $\mathcal{EL}$ (Q2849496) (← links)
- Unification in modal and description logics (Q2889571) (← links)
