Katalog der Deutschen Nationalbibliothek

Go to:

Knowledge Web

Person
Person

Person

Franz Baader (1959-)

Informatiker

Name

Franz Baader

Time

1959- (Date of birth and death)

Place

Aachen (1993-2001) (Wirkungsort)
Dresden (2001-) (Wirkungsort)
Deutschland

Gender

männlich

Profession

Informatiker (characteristic profession)

Variant

F. Baader
Frans Baader (falsche Namensform)

Topic

Personen zu Informatik, Datenverarbeitung

Further information

Dt. Informatiker; von 1993 bis 2001 als außerordentlicher Prof. für Theoretische Informatik an der RWTH Aachen tätig; seit 2001 Prof. für Automatentheorie am Institut für Theoretische Informatik an der TU Dresden

Source

LCAuth

Record type

Person

GND-Identifier

131845098

Record ID

131845098

Involved in

show all

Complexity and Expressive Power of Description Logics with Numerical Constraints

Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count : Extended Version

The Unification Type of an Equational Theory May Depend on the Instantiation Preorder

Context-Sensitive Description Logics in Dynamic Settings

Inconsistency- and Error-Tolerant Reasoning w.r.t. Optimal Repairs of EL⊥ Ontologies

On the Abstract Expressive Power of Description Logics with Concrete Domains : Extended Version

On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems

On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems

The Infimum Problem as a Generalization of the Inclusion Problem for Automata

Unification in the Description Logic ELHR+ without the Top Concept modulo Cycle-Restricted Ontologies : (Extended Version)

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains

Automatic Translation of Clinical Trial Eligibility Criteria into Formal Queries : Extended Version

Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques

Unification in Commutative Theories, Hilbert's Basis Theorem, and Gröbner Bases

Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains

A finite basis for the set of EL-implications holding in a finite model

A Goal-Oriented Algorithm for Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies

A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL

A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics

A New n-ary Existential Quantifier in Description Logics

Adding Causal Relationships to DL-based Action Formalisms

Adding Threshold Concepts to the Description Logic EL

An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version

Approximate Unification in the Description Logic FL₀

Approximately Solving Set Equations

Approximation in Description Logics : How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL₀

Axiom Pinpointing in General Tableaux

Blocking and Pinpointing in Forest Tableaux

Combination of Compatible Reduction Orderings that are Total on Ground Terms

Completing Description Logic Knowledge Bases using Formal Concept Analysis

Computing Boundaries for Reasoning in Sub-Ontologies

Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies : Extended Version

Computing Least Common Subsumer in Description Logics with Existential Restrictions

Computing Minimal EL-Unifiers is Hard

Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes (Extended Version)

Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions

Concept Descriptions with Set Constraints and Cardinality Constraints

Connecting many-sorted theories

Constructing SNOMED CT Concepts via Disunification

Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures

Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols

Description Logics with Aggregates and Concrete Domains

Description Logics with Aggregates and Concrete Domains, Part II

Description Logics with Symbolic Number Restrictions

Dismatching and Local Disunification in EL

Exploring finite models in the Description Logic ELgfp

Extending the Description Logic τEL(deg) with Acyclic TBoxes

Hybrid Unification in the Description Logic EL

Integrate Action Formalisms into Linear Temporal Description Logics

Integrating Description Logics and Action Formalisms for Reasoning about Web Services

Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles

LTL over Description Logic Axioms

Matching Concept Descriptions with Existential Restrictions

Matching Concept Descriptions with Existential Restrictions Revisited

Matching under Side Conditions in Description Logics

Matching with respect to general concept inclusions in the Description Logic EL

Metric Temporal Description Logics with Interval-Rigid Names : Extended Version

Number Restrictions on Complex Roles in Description Logics
Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

DNB portal