Franz Baader
66 publications
13 venues
H Index 32
Affiliation
Dresden University of Technology, GermanyHerbrand Award
Links
DBLPGoogle Scholar
ORCID- http://lat.inf.tu-dresden.de/~baader/
- https://dl.acm.org/profile/81508686184
- https://zbmath.org/authors/?q=ai:baader.franz
- https://mathscinet.ams.org/mathscinet/MRAuthorID/231569
- https://mathgenealogy.org/id.php?id=65090
- https://en.wikipedia.org/wiki/Franz_Baader
- https://www.wikidata.org/entity/Q92729
- https://www.researcherid.com/rid/Q-6099-2016
- http://isni.org/isni/0000000114414448
- https://viaf.org/viaf/34634110
- https://id.loc.gov/authorities/names/n96080351
- https://d-nb.info/gnd/131845098
| Name | Venue | Year | citations |
|---|---|---|---|
Contractions Based on Optimal Repairs.
|
KR | 2024 | 0 |
| Extending the description logic EL with threshold concepts induced by concept measures.
|
Artificial Intelligence | 2024 | 0 |
| Optimal Repairs in the Description Logic
|
JELIA | 2023 | 0 |
| Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs.
|
KR | 2022 | 2 |
| Optimal ABox Repair w.r.t. Static
|
ESWC | 2022 | 0 |
| An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics.
|
JELIA | 2021 | 2 |
| Computing Optimal Repairs of Quantified ABoxes w.r.t. Static
|
CADE | 2021 | 0 |
| Finding Good Proofs for Description Logic Entailments using Recursive Quality Measures.
|
CADE | 2021 | 0 |
| Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints.
|
ECAI | 2020 | 11 |
| Computing Compliant Anonymisations of Quantified ABoxes w.r.t.
|
ISWC | 2020 | 0 |
| Finding Small Proofs for Description Logic Entailments: Theory and Practice.
|
LPAR | 2020 | 0 |
| Privacy-Preserving Ontology Publishing for
|
JELIA | 2019 | 0 |
| Counting Strategies for the Probabilistic Description Logic 𝓐ℒ𝒞
|
JELIA | 2019 | 0 |
| Making Repairs in Description Logics More Gentle.
|
KR | 2018 | 33 |
| Matching in the Description Logic FL0 with respect to General TBoxes.
|
LPAR | 2018 | 0 |
| Query Rewriting for DL-Lite with n-ary Concrete Domains.
|
IJCAI | 2017 | 11 |
| Extending the Description Logic with Acyclic TBoxes.
|
ECAI | 2016 | 2 |
| Query and Predicate Emptiness in Ontology-Based Data Access.
|
JAIR | 2016 | 30 |
| Approximate Unification in the Description Logic
|
JELIA | 2016 | 0 |
| Ontology-Based Monitoring of Dynamic Systems.
|
KR | 2014 | 10 |
| Invited Talks.
|
KR | 2014 | 0 |
| Temporalizing Ontology-Based Data Access.
|
CADE | 2013 | 57 |
| Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints.
|
LPAR | 2012 | 9 |
| Extending Unification in EL Towards General TBoxes.
|
KR | 2012 | 38 |
| Unification in the Description Logic
|
CADE | 2011 | 0 |
| Query and Predicate Emptiness in Description Logics.
|
KR | 2010 | 23 |
| Verifying Properties of Infinite Sequences of Description Logic Actions.
|
ECAI | 2010 | 26 |
| A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms.
|
ISWC | 2009 | 46 |
| A Novel Architecture for Situation Awareness Systems.
|
TABLEAUX | 2009 | 59 |
| LTL over Description Logic Axioms.
|
KR | 2008 | 113 |
| Axiom Pinpointing in General Tableaux.
|
TABLEAUX | 2007 | 164 |
| Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
|
IJCAI | 2007 | 204 |
| Connecting Many-Sorted Theories.
|
CADE | 2005 | 47 |
| Integrating Description Logics and Action Formalisms: First Results.
|
AAAI | 2005 | 206 |
| Pushing the EL Envelope.
|
IJCAI | 2005 | 1262 |
| Computing the Least Common Subsumer w.r.t. a Background Terminology.
|
JELIA | 2004 | 132 |
| Engineering of Logics for the Content-Based Representation of Information.
|
JELIA | 2004 | 0 |
| Terminological Cycles in a Description Logic with Existential Restrictions.
|
IJCAI | 2003 | 247 |
| From Tableaux to Automata for Description Logics.
|
LPAR | 2003 | 58 |
| Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles.
|
IJCAI | 2003 | 116 |
| Fusions of Description Logics and Abstract Description Systems.
|
JAIR | 2002 | 0 |
| Unification in a Description Logic with Transitive Closure of Roles.
|
LPAR | 2001 | 66 |
| Matching under Side Conditions in Description Logics.
|
IJCAI | 2001 | 23 |
| Matching Concept Descriptions with Existential Restrictions.
|
KR | 2000 | 8 |
| Rewriting Concepts Using Terminologies.
|
KR | 2000 | 83 |
| Tableau Algorithms for Description Logics.
|
TABLEAUX | 2000 | 100 |
| Computing Least Common Subsumers in Description Logics with Existential Restrictions.
|
IJCAI | 1999 | 241 |
| Description Logics with Concrete Domains and Aggregation.
|
ECAI | 1998 | 48 |
| Unification of Concept Terms in Description Logics.
|
ECAI | 1998 | 0 |
| A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method.
|
CADE | 1997 | 37 |
| Description Logics with Symbolic Number Restrictions.
|
ECAI | 1996 | 28 |
| Number Restrictions on Complex Roles in Description Logics: A Preliminary Report.
|
KR | 1996 | 47 |
| Cardinality Restrictions on Concepts.
|
Artificial Intelligence | 1996 | 0 |
| On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers.
|
CP | 1995 | 43 |
| Terminological Logics with Modal Operators.
|
IJCAI | 1995 | 60 |
| How to Prefer More Specific Defaults in Terminological Default Logic.
|
IJCAI | 1993 | 107 |
| Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures.
|
CADE | 1992 | 233 |
| An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On.
|
KR | 1992 | 250 |
| Embedding Defaults into Terminological Knowledge Representation Formalisms.
|
KR | 1992 | 0 |
| Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles.
|
IJCAI | 1991 | 202 |
| A Scheme for Integrating Concrete Domains into Concept Languages.
|
IJCAI | 1991 | 473 |
| Qualifying Number Restrictions in Concept Languages.
|
KR | 1991 | 189 |
| Tutorial on Reasoning and Representation with Concept Languages.
|
CADE | 1990 | 0 |
| Terminological Cycles in KL-ONE-based Knowledge Representation Languages.
|
AAAI | 1990 | 98 |
| Rewrite Systems for Varieties of Semigroups.
|
CADE | 1990 | 9 |
| A Formal Definition for the Expressive Power of Knowledge Representation Languages.
|
ECAI | 1990 | 39 |