F. Baader.
Unification in Varieties of Idempotent Semigroups.
Semigroup Forum, 36:127–145, 1987.
Bibtex entry Free reprint
F. Baader.
A Note on Unification Type Zero.
Information Processing Letters, 27:91–93, 1988.
Bibtex entry Free reprint
F. Baader.
Unification in Commutative Theories.
J. Symbolic Computation, 8:479–497, 1989.
Bibtex entry Free reprint
F. Baader.
A Formal Definition for the Expressive Power of Terminological Knowledge
Representation Languages.
J. of Logic and Computation, 6(1):33–54, 1996.
Bibtex entry Abstract Free reprint
F. Baader.
Using Automata Theory for Characterizing the Semantics of Terminological
Cycles.
Annals of Mathematics and Artificial Intelligence, 18(2–4):175–219,
1996.
Bibtex entry Abstract Free reprint
F. Baader, M. Buchheit, and B. Hollunder.
Cardinality Restrictions on Concepts.
Artificial Intelligence, 88(1–2):195–213, 1996.
Bibtex entry Abstract Free reprint
F. Baader and W. Büttner.
Unification in Commutative Idempotent Monoids.
J. Theoretical Computer Science, 56:345–352, 1988.
Bibtex entry Free reprint
F. Baader and B. Hollunder.
Embedding Defaults into Terminological Representation Systems.
J. Automated Reasoning, 14:149–180, 1995.
Bibtex entry Abstract Free reprint
F. Baader and B. Hollunder.
Priorities on Defaults with Prerequisites, and their Application in
Treating Specificity in Terminological Default Logic.
J. Automated Reasoning, 15:41–68, 1995.
Bibtex entry Abstract Free reprint
F. Baader, R. Küsters, A. Borgida, and D. McGuinness.
Matching in Description Logics.
Journal of Logic and Computation, 9(3):411–447, 1999.
Bibtex entry Abstract
F. Baader and P. Narendran.
Unification of Concepts Terms in Description Logics.
J. Symbolic Computation, 31(3):277–305, 2001.
Bibtex entry Abstract Free reprint
F. Baader and U. Sattler.
Expressive Number Restrictions in Description Logics.
Journal of Logic and Computation, 9(3):319–350, 1999.
Bibtex entry Abstract Paper (PS)
F. Baader and U. Sattler.
Description Logics with Aggregates and Concrete Domains.
Information Systems, 28(8):979–1004, 2003.
Bibtex entry Abstract Paper (PS) Free reprint
F. Baader and K. Schulz.
Combination of Constraint Solvers for Free and Quasi-Free Structures.
Theoretical Computer Science, 192:107–161, 1998.
Bibtex entry Abstract Free reprint
F. Baader and K. U. Schulz.
Unification in the Union of Disjoint Equational Theories: Combining
Decision Procedures.
J. Symbolic Computation, 21:211–243, 1996.
Bibtex entry Abstract Free reprint
F. Baader and K.U. Schulz.
Combination Techniques and Decision Problems for Disunification.
Theoretical Computer Science B, 142:229–255, 1995.
Bibtex entry Abstract Free reprint
F. Baader and W. Snyder.
Unification Theory.
In J.A. Robinson and A. Voronkov, editors, Handbook of Automated
Reasoning, volume I, pages 447–533. Elsevier Science Publishers, 2001.
See the handbook Web pages of Andrei Voronkov (http://www.cs.man.ac.uk/˜voronkov/handbook-ar/index.html) and
Elsevier (http://www.elsevier.nl/locate/isbn/0444829490).
Bibtex entry Abstract Paper (PS) Free reprint
F. Baader and C. Tinelli.
Deciding the Word Problem in the Union of Equational Theories.
Information and Computation, 178(2):346–390, 2002.
Bibtex entry Abstract Free reprint
V. Haarslev, C. Lutz, and R. Möller.
A Description Logic with Concrete Domains and Role-forming Predicates.
Journal of Logic and Computation, 9(3):351–384, 1999.
Bibtex entry Abstract Paper (PS)
I. Horrocks and U. Sattler.
A Description Logic with Transitive and Inverse Roles and Role
Hierarchies.
Journal of Logic and Computation, 9(3):385–410, 1999.
Bibtex entry Abstract
Stephan Tobies.
PSPACE Reasoning for Graded Modal Logics.
Journal of Logic and Computation, 11(1):85–106, 2001.
Bibtex entry Abstract Paper (PS)
Back to the homepage of the Chair for Automata Theory.