BibSLEIGH — Franz

Travelled to:

1 × Austria
1 × Brazil
1 × Denmark
1 × Estonia
1 × Germany
1 × Ireland
1 × Spain
1 × United Kingdom
2 × Canada
3 × Australia
3 × Poland
4 × Italy
7 × USA

Collaborated with:

∅ B.Morawska C.Tinelli S.Borgwardt K.U.Schulz B.Hollunder S.Ghilardi C.Lutz R.Peñaloza R.Küsters W.Nutt S.Tobies U.Sattler B.Nebel M.Lippmann J.Mendez A.Bauer A.Tiu J.Hladik B.Suntisrivaraporn R.Molitor T.B.Nguyen M.Bienvenu F.Wolter H.Profitlich E.Franconi J.Müller G.Smolka

Talks about:

unif (10) descript (9) logic (9) combin (8) problem (5) concept (5) theori (5) represent (4) restrict (4) procedur (4)

Person: Franz Baader

DBLP: Baader:Franz

Facilitated 2 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1997

1996

1995

1993

1992

1991

1990

1989

Wrote 36 papers:

RTA-2015-BaaderBM: Dismatching and Local Disunification in EL (FB, SB, BM), pp. 40–56.
KR-2014-Baader #monitoring #ontology: Ontology-Based Monitoring of Dynamic Systems (FB).
CADE-2013-BaaderBL #data access #ontology: Temporalizing Ontology-Based Data Access (FB, SB, ML), pp. 330–344.
IJCAR-2012-BaaderBM #encoding #ontology #satisfiability #strict #unification: SAT Encoding of Unification in ℰℒℋ_R⁺ w.r.t. Cycle-Restricted Ontologies (FB, SB, BM), pp. 30–44.
IJCAR-2012-BaaderMM #logic #named #unification: UEL: Unification Solver for the Description Logic ℰℒ — System Description (FB, JM, BM), pp. 45–51.
KR-2012-BaaderBM #towards #unification: Extending Unification in EL Towards General TBoxes (FB, SB, BM).
CADE-2011-BaaderBBM #concept #logic #unification: Unification in the Description Logic EL without the Top Concept (FB, TBN, SB, BM), pp. 70–84.
KR-2010-BaaderBLW #logic #query: Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
LATA-2009-BaaderBT #policy: Matching Trace Patterns with Regular Policies (FB, AB, AT), pp. 105–116.
RTA-2009-BaaderM #logic #unification: Unification in the Description Logic EL (FB, BM), pp. 350–364.
IJCAR-2008-BaaderP #axiom: Automata-Based Axiom Pinpointing (FB, RP), pp. 226–241.
KR-2008-BaaderGL #axiom #logic #ltl: LTL over Description Logic Axioms (FB, SG, CL), pp. 684–694.
LATA-2007-BaaderHP #automaton #exclamation #logic: SI! Automata Can Show PSPACE Results for Description Logics (FB, JH, RP), pp. 67–78.
IJCAR-2006-BaaderLS #named #ontology #polynomial: CEL — A Polynomial-Time Reasoner for Life Science Ontologies (FB, CL, BS), pp. 287–291.
CADE-2005-BaaderG: Connecting Many-Sorted Theories (FB, SG), pp. 278–294.
IJCAR-2004-BaaderGT #decidability #logic #problem #word: A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics (FB, SG, CT), pp. 183–197.
RTA-2002-Baader #logic #representation: Engineering of Logics for the Content-Based Representation of Information (FB), p. 23.
RTA-2002-BaaderT: Combining Decision Procedures for Positive Theories Sharing Constructors (FB, CT), pp. 352–366.
IJCAR-2001-BaaderT #approach #automaton #satisfiability: The Inverse Method Implements the Automata Approach for Modal Satisfiability (FB, ST), pp. 92–106.
KR-2000-BaaderK #concept #strict: Matching Concept Descriptions with Existential Restrictions (FB, RK), pp. 261–272.
KR-2000-BaaderKM #concept #using: Rewriting Concepts Using Terminologies (FB, RK, RM), pp. 297–308.
RTA-1999-BaaderT #equation #problem #word: Deciding the Word Problem in the Union of Equational Theories Sharing Constructors (FB, CT), pp. 175–189.
CADE-1997-BaaderT #approach #problem #word: A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method (FB, CT), pp. 19–33.
LICS-1997-Baader #order #reduction: Combination of Compatible Reduction Orderings that are Total on Ground Terms (FB), pp. 2–13.
KR-1996-BaaderS #logic #strict: Number Restrictions on Complex Roles in Description Logics: A Preliminary Report (FB, US), pp. 328–339.
RTA-1995-BaaderS #algebra #constraints #perspective #theorem proving: Combination of Constraint Solving Techniques: An Algebraic POint of View (FB, KUS), pp. 352–366.
RTA-1993-BaaderS #problem: Combination Techniques and Decision Problems for Disunification (FB, KUS), pp. 301–315.
CADE-1992-BaaderS #equation #unification: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures (FB, KUS), pp. 50–65.
KR-1992-BaaderH #information management #representation: Embedding Defaults into Terminological Knowledge Representation Formalisms (FB, BH), pp. 306–317.
KR-1992-BaaderHNPF #analysis #empirical #optimisation #representation: An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On (FB, BH, BN, HJP, EF), pp. 270–281.
KR-1991-HollunderB #concept #strict: Qualifying Number Restrictions in Concept Languages (BH, FB), pp. 335–346.
RTA-1991-Baader #bound #problem #unification: Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems (FB), pp. 86–97.
RTA-1991-BaaderN #algebra #commutative #equation #how #morphism #unification: Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification (FB, WN), pp. 124–135.
CADE-1990-Baader #term rewriting: Rewrite Systems for Varieties of Semigroups (FB), pp. 396–410.
CADE-1990-MullerBNNS #concept #reasoning #representation #tutorial: Tutorial on Reasoning and Representation with Concept Languages (JM, FB, BN, WN, GS), p. 681.
RTA-1989-Baader #unification: Characterization of Unification Type Zero (FB), pp. 2–14.