Searching for authors named Franz Baader – sorted by Relevance.
-
Combination of Compatible Reduction Orderings that are Total on Ground Terms (Extended Abstract)
- -- Franz Baader LuFg Theoretical Computer Science, RWTH Aachen Ahornstra��e 55, 52074 Aachen, Germany e
- Cited by 1 (0 self) – Add To MetaCart
-
Restricted Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles
- cycles Franz Baader ∗ Theoretical Computer Science, Dresden University of Technology D-01062 Dresden
- Cited by 1 (1 self) – Add To MetaCart
-
Computing a Minimal Representation of the Subsumption Lattice of All Conjunctions of Concepts Defined in a Terminology
- Defined in a Terminology ? Franz Baader Lehr- und Forschungsgebiet Theoretische Informatik, RWTH Aachen
- Cited by 21 (1 self) – Add To MetaCart
-
Logic-based Knowledge Representation
- Logic-based Knowledge Representation ? Franz Baader Theoretical Computer Science, RWTH Aachen
- Cited by 21 (0 self) – Add To MetaCart
-
How to Prefer More Specific Defaults in Terminological Default Logic
- How to Prefer More Specific Defaults in Terminological Default Logic Franz Baader and Bernhard
- Cited by 39 (1 self) – Add To MetaCart
-
Description Logics with Symbolic Number Restrictions
- Description Logics with Symbolic Number Restrictions Franz Baader and Ulrike Sattler 1 Abstract
- Cited by 11 (5 self) – Add To MetaCart
-
TBoxes do not yield a compact representation of least common subsumers
- TBoxes do not yield a compact representation of least common subsumers Franz Baader and Anni
- Cited by 1 (1 self) – Add To MetaCart
-
On Language Equations with One-Sided Concatenation
- Theory LTCS–Report On Language Equations with One-sided Concatenation Franz Baader Alexander Okhotin LTCS
- Cited by 1 (1 self) – Add To MetaCart
-
The Inverse Method Implements the Automata Approach for Modal Satisfiability
- The Inverse Method Implements the Automata Approach for Modal Satisability Franz Baader
- Cited by 16 (5 self) – Add To MetaCart
-
Least common subsumer computation w.r.t. cyclic ALN-terminologies
- Least common subsumer computation w.r.t. cyclic ALN -terminologies Franz Baader and Ralf Kusters
- Cited by 6 (1 self) – Add To MetaCart

