The following pages link to Franz Baader (Q171404):
Displaying 41 items.
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification (Q5055754) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- Unification properties of commutative theories: A categorical treatment (Q5096265) (← links)
- Metric Temporal Description Logics with Interval-Rigid Names (Q5121281) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- Unification in the Description Logic $\mathcal{EL}$ without the Top Concept (Q5200016) (← links)
- Matching in the Description Logic FL0 with respect to General TBoxes (Q5222946) (← links)
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
- (Q5277870) (← links)
- Connecting many-sorted theories (Q5294025) (← links)
- Automated Reasoning (Q5307057) (← links)
- Logics in Artificial Intelligence (Q5394108) (← links)
- Logics in Artificial Intelligence (Q5394140) (← links)
- Automated Deduction – CADE-20 (Q5394620) (← links)
- (Q5419868) (← links)
- Axiom Pinpointing in General Tableaux (Q5434476) (← links)
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model (Q5445322) (← links)
- (Q5477943) (← links)
- Frontiers of Combining Systems (Q5491891) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710798) (← links)
- Mechanizing Mathematical Reasoning (Q5717442) (← links)
- Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ (Q5738984) (← links)
- (Q5747087) (← links)
- KI 2003: Advances in Artificial Intelligence (Q5897297) (← links)
- KI 2005: Advances in Artificial Intelligence (Q5897738) (← links)
- Conceptual Structures for Knowledge Creation and Communication (Q5900604) (← links)
- Concept Lattices (Q5901755) (← links)
- Unification of concept terms in description logics (Q5929707) (← links)
- An overview of tableau algorithms for description logics (Q5955620) (← links)
- Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)
- Unification in varieties of completely regular semigroups (Q6114512) (← links)
- Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures (Q6152660) (← links)
- Unification theory (Q6169561) (← links)
- Mixing Description Logics in Privacy-Preserving Ontology Publishing (Q6488091) (← links)
- Rewrite systems for varieties of semigroups (Q6488547) (← links)
- Optimal repairs in the description logic \(\mathcal{EL}\) revisited (Q6545515) (← links)
- Inconsistency- and error-tolerant reasoning w.r.t. optimal repairs of \(\mathcal{EL}^\bot\) ontologies (Q6630183) (← links)
- Evonne: Interactive Proof Visualization for Description Logics (System Description) - IJCAR22 - Resources (Q6700525) (← links)
- Finding Small Proofs for Description Logic Entailments: Theory and Practice - LPAR20 - Resources (Q6700527) (← links)
- Combining Proofs for Description Logic and Concrete Domain Reasoning - RuleML+RR23 - Resources (Q6700529) (← links)
