Liste der geplanten LTCS-Reports

Wer einen LTCS-Report veröffentlichen will, schickt bitte ein Mail mit Titel und Autoren an Francesco Kriegel und erhält im Gegenzug eine Nummer zugewiesen. Man sollte auch die Hinweise zum Titelblatt für LTCS-Reports beachten.

Bisher wurden die folgenden Nummern vergeben:

2019

LTCS-Report 19-01: Franz Baader, Francesco Kriegel, Adrian Nuradiansyah: Privacy-Preserving Ontology Publishing for EL Instance Stores (Extended Version)
LTCS-Report 19-02: Francesco Kriegel: Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic (Extended Version)
LTCS-Report 19-03: Patrick Koopmann: Maybe Eventually? Towards Combining Temporal and Probabilistic Description Logics and Queries (Extended Version)
LTCS-Report 19-04: Satyadharma Tirtarasa, Benjamin Zarrieß: Projection in a Description Logic of Context with Actions (Extended Version)
LTCS-Report 19-05: Christian Alrabbaa and Patrick Koopmann and Anni-Yasmin Turhan: Practical Query Rewriting for DL-Lite with Concrete Domains
LTCS-Report 19-06: C. Dubslaff, P. Koopmann, and A.-Y. Turhan: Ontology-Mediated Probabilistic Model Checking

2018

LTCS-Report 18-01: Franz Baader, Francesco Kriegel, Adrian Nuradiansyah, Rafael Peñaloza: Repairing Description Logic Ontologies by Weakening Axioms
LTCS-Report 18-02: Anni-Yasmin Turhan: TBA
LTCS-Report 18-03: Francesco Kriegel: Terminological Knowledge Acquisition in Probabilistic Description Logic
LTCS-Report 18-04: Franz Baader, Oliver Fernandez Gil, Maximilian Pensel: Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata
LTCS-Report 18-05: Benjamin Zarrieß: Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic
LTCS-Report 18-06: Patrick Koopmann, Benjamin Zarrieß: On the Complexity of Verifying Timed Golog Programs over Description Logic Actions (Extended Version)
LTCS-Report 18-07: Patrick Koopmann: Ontology-Based Query Answering for Probabilistic Temporal Data (Extended Version)
LTCS-Report 18-08: Patrick Koopmann: DL Actions with Conjunctive Queries: Projection, Conflict Detection and Verification
LTCS-Report 18-09: Clemens Dubslaff, Patrick Koopmann, Anni-Yasmin Turhan: Contextualized Programs for Ontology-Mediated Probabilistic System Analysis
LTCS-Report 18-10: Francesco Kriegel: The Distributive, Graded Lattice of 𝓔𝓛 Concept Descriptions and its Neighborhood Relation (Extended Version)
LTCS-Report 18-11: Francesco Kriegel: Most Specific Consequences in the Description Logic 𝓔𝓛
LTCS-Report 18-12: Francesco Kriegel: Learning Description Logic Axioms from Discrete Probability Distributions over Description Graphs
LTCS-Report 18-13: Patrick Koopmann: Ontology-Based Query Answering for Probabilistic Temporal Data (Extended Version)
LTCS-Report 18-14: David Carral, Larry Gonzalez, Patrick Koopmann: From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment (Extended Version)

2017

LTCS-Report 17-01: A.-Y. Turhan and Maximilian Pensel: Defeasible Reasoning in 𝓔𝓛^⊥ including quantified concepts
LTCS-Report 17-02: F. Baader: Concept Descriptions with Set Constraints and Cardinality Constraints
LTCS-Report 17-03: F. Baader, S. Borgwardt, P. Koopmann, A. Ozaki, V. Thost: Metric Temporal Description Logics with Interval-Rigid Names (Extended Version)
LTCS-Report 17-04: F. Baader, S. Borgwardt, M. Lippmann: Query Rewriting for DL-Lite with n-ary Concrete Domains
LTCS-Report 17-05: F. Baader, P. Koopmann, A.-Y. Turhan: Using Ontologies to Query Probabilistic Numerical Data
LTCS-Report 17-06: C. Bourgaux and A.-Y. Turhan: Temporal Query Answering in DL-Lite over Inconsistent Data

2016

LTCS-Report 16-09: F. Baader, P. Koopmann, und A.-Y. Turhan: Querying Numerical Data that Follow Continuous Distributions using Ontologies
LTCS-Report 16-08: F. Baader, O. Fernandez Gil, und P. Marantidis: Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in 𝓕𝓛₀
LTCS-Report 16-07: F. Baader und O. Fernandez Gil: Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures
LTCS-Report 16-06: S. Borgwardt und M. Lippmann: Multi-sorted Conjunctive Queries with Concrete Domains
LTCS-Report 16-05: F. Kriegel: Axiomatization of General Concept Inclusions from Streams of Interpretations
LTCS-Report 16-04: F. Baader, P. Marantidis, and A. Okhotin: Approximate Unification in the Description Logic 𝓕𝓛₀
LTCS-Report 16-03: F. Baader, P. Marantidis, and A. Okhotin: Approximately Solving Set Equations
LTCS-Report 16-02: F. Baader and O. Fernandez Gil: Extending the Description Logic τ𝓔𝓛(deg) with Acyclic TBoxes.
LTCS-Report 16-01: C. Carapelle and A.-Y. Turhan: Decidability of ALC(D) with concrete domains with the EHD property

2015

LTCS-Report 15-20: S. Borgwardt and M. Lippmann: DL-Lite with Concrete and Temporal Domains
LTCS-Report 15-19: B. Zarrieß and J. Claßen: Decidable Verification of Golog Programs over Non-Local Effect Actions
LTCS-Report 15-18: S. Borgwardt and R. Peñaloza: Gödel-SROIQ Tableaux
LTCS-Report 15-17: F. Baader, S. Borgwardt, and M. Lippmann: SHOIQ-TCQs
LTCS-Report 15-16: S. Borgwardt and V. Thost: Temporal Query Answering in DL-Lite Including Negation
LTCS-Report 15-15: F. Kriegel: Probabilistic Implicational Bases in FCA and Probabilistic Bases of GCIs in EL
LTCS-Report 15-14: F. Kriegel: Learning in Probabilistic Description Logics
LTCS-Report 15-13: D. Borchmann, F. Distel, and F. Kriegel: Axiomatization of General Concept Inclusions from Finite Interpretations
LTCS-Report 15-12: V. Thost, J. Holste, and Ö. Özcep: On Implementing Temporal Query Answering in DL-Lite
LTCS-Report 15-11: S. Borgwardt and R. Peñaloza: Gödel-SROIQ
LTCS-Report 15-10: B. Zarrieß and J. Claßen: Verification of Knowledge-Based Programs over Description Logic Actions
LTCS-Report 15-09: F. Baader, G. Brewka, and O. Fernandez Gil: Adding Threshold Concepts to the Description Logic EL
LTCS-Report 15-08: S. Borgwardt and V. Thost: EL-TCQs
LTCS-Report 15-07: S. Borgwardt and V. Thost: EL-LTL
LTCS-Report 15-06: S. Borgwardt, M. Cerami, and R. Peñaloza: Fuzzy-EL
LTCS-Report 15-05: N. Manthey and R. Peñaloza: Exploting SAT Technology for Axiom Pinpointing
LTCS-Report 15-04: S. Boehme and M. Lippmann: Contextualizing ALC
LTCS-Report 15-03: F. Baader, S. Borgwardt, and B. Morawska: Disunification in EL
LTCS-Report 15-02: F. Kriegel: Learning Terminological Knowledge from Interpretations — Some Extensions
LTCS-Report 15-01: F. Kriegel: NextClosures — Parallel Exploration of Constrained Closure Operators

2014

LTCS-Report 14-11: M. Ludwig, R. Peñaloza: Error-Tolerant Reasoning in the Description Logic EL
LTCS-Report 14-10: Y. Ma: Learning Snomed GCIs from Textual Data — First Report
LTCS-Report 14-09: Y. Ma: Ontology-based Redundancy-Free Labelling
LTCS-Report 14-08: Y. Ma: Learning Description Logic Based Concept Definitions: GUI and Extensions
LTCS-Report 14-07: F. Baader, S. Borgwardt, B. Morawska, and O. Sabuncu: Encoding Local Disunification in EL into Propositional Problems
LTCS-Report 14-06: S. Borgwardt, M. Lippmann, and V. Thost: Reasoning with Temporal Properties over Axioms of DL-Lite
LTCS-Report 14-05: Y. Ma and R. Peñaloza: Towards Parallel Ontology Repair using Decompositions
LTCS-Report 14-04: R. Peñaloza, V. Thost, and A.-Y. Turhan: Query Answering in a Light-weight Rough Description Logic
LTCS-Report 14-03: F. Baader and B. Morawska: Matching with respect to general concept inclusions in the Description Logic EL
LTCS-Report 14-02: S. Borgwardt: Fuzzy Description Logics with Nominals
LTCS-Report 14-01: F. Baader and M. Lippmann: Runtime Verification Using a Temporal Description Logic Revisited

2013

LTCS-Report 13-12: A. Ecke and A.-Y. Turhan: Similarity in Description Logics
LTCS-Report 13-11: D. Borchmann: Model Exploration by Confidence with Completely Specified Counterexamples
LTCS-Report 13-10: B. Zarriess and J. Classen: On the Decidability of Verifying LTL Properties of Golog Programs
LTCS-Report 13-09: S. Borgwardt, F. Distel, and R. Peñaloza: Reasoning with Goedel Description Logics
LTCS-Report 13-08: F. Baader and B. Zarriess: Verification of Golog Programs over Description Logic Axioms
LTCS-Report 13-07: F. Baader, O. Fernandez-Gil, and B. Morawska: Hybrid Unification in the Description Logic EL
LTCS-Report 13-06: B. Zarriess and A-Y Turhan: Most Specific Generalizations wrt General EL-TBoxes
LTCS-Report 13-05: S. Borgwardt, M. Lippmann, and V. Thost: Temporal Query Answering in DL-Lite: First Steps
LTCS-Report 13-04: D. Borchmann: Exploration by Confidence
LTCS-Report 13-03: F. Distel and Y. Ma: Learning Formal Definitions for Snomed CT from Text
LTCS-Report 13-02: D. Borchmann: A General Form of Attribute Exploration
LTCS-Report 13-01: F. Baader, S. Borgwardt, and M. Lippmann: Complexity of Temporal Query Answering

2012

LTCS-Report 12-06: D. Borchmann: On Confident GCIs of Finite Interpretations
LTCS-Report 12-05: F. Baader, S. Borgwardt, B. Morawska: /A Goal-Oriented Algorithm for Unification in ELH\_R\^+ w.r.t. Cycle Restricted Ontologies/
LTCS-Report 12-04: S. Borgwardt, R. Peñaloza: Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices
LTCS-Report 12-03: F. Baader, S. Borgwardt, B. Morawska: Computing Minimal EL-Unifiers is Hard
LTCS-Report 12-02: F. Baader, S. Borgwardt, B. Morawska: SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies
LTCS-Report 12-01: F. Baader and A. Okhotin: Solving Language Equations and Disequations using Looping Tree Automata with Colors

2011

LTCS-Report 11-06: S. Borgwardt and R. Peñaloza: Undecidability of Fuzzy Description Logics
LTCS-Report 11-05: F. Baader, S. Borgwardt, and B. Morawska: Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes
LTCS-Report 11-04: S. Borgwardt and B. Morawska: Finding Finite Herbrand Models
LTCS-Report 11-03: R. Peñaloza: A Correct Blocking Condition for Fuzzy ALC Consistency
LTCS-Report 11-02: S. Borgwardt and R. Peñaloza: Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Cersion
LTCS-Report 11-01: F. Baader, N. T. Binh, S. Borgwardt, and B. Morawska: Unification in the Description Logic EL Without Top Constructor

2010

LTCS-Report 10-05: S. Borgwardt and R. Peñaloza: The Inclusion Problem for Weighted Automata on Infinite Trees
LTCS-Report 10-04: F. Baader and B. Morawska: SAT encoding of unification in the Description Logic EL
LTCS-Report 10-03: R. Peñaloza and A.-Y. Turhan: Completion-based MSC
LTCS-Report 10-02: R. Peñaloza and A.-Y. Turhan: Completion-based LCS
LTCS-Report 10-01: F. Baader, M. Lippmann, and H. Liu: Adding Causal Relations to Description Logic Action Formalisms

2009

LTCS-Report 09-04: R. Peñaloza and B. Sertkaya: On the Complexity of Axiom Pinpointing in Description Logics
LTCS-Report 09-03: F. Baader, H. Liu, and A. Mehdi: Integrate Action Formalisms into Linear Temporal Description Logics
LTCS-Report 09-02: F. Baader, M. Knechtel, and R. Peñaloza: Computing Boundaries for Reasoning in Sub-Ontologies
LTCS-Report 09-01: C. Drescher, H. Liu, F. Baader, S. Guhlemann, U. Petersohn, P. Steinke, and M. Thielscher: Putting ABox Updates into Action

2008

LTCS-Report 08-04: F. Distel: Model-based Most Specific Concepts in Description Logics with Value Restriction
LTCS-Report 08-03: F. Baader, R. Peñaloza: Pinpointing in Terminating Forest Tableaux
LTCS-Report 08-02: R. Peñaloza: Finite-time Pinpointing Approaches
LTCS-Report 08-01: F. Baader, S. Ghilardi, C. Lutz: LTL over Description Logic Axioms

2007

LTCS-Report 07-03: B. Suntisrivaraporn: Module Extraction and Incremental Classification: A pragmatic approach for EL+ Ontologies
LTCS-Report 07-02: F. Baader, F. Distel: A finite basis for the set of EL-implications holding in a finite model
LTCS-Report 07-01: F. Baader, R. Peñaloza: Axiom Pinpointing in General Tableaux

2006

LTCS-Report 06-05: R. Peñaloza: Pinpointing in Tableaus
LTCS-Report 06-04: F. Baader, J. Hladik, and R. Peñaloza: PSPACE Automata with Blocking for Description Logics
LTCS-Report 06-03: H. Liu, C. Lutz, M. Milicic, and F. Wolter: Description Logic Actions with general TBoxes: a Pragmatic Approach
LTCS-Report 06-02: B. Glimm, I. Horrocks, C. Lutz, and U. Sattler: Conjunctive Query Answering in the Description Logic SHIQ
LTCS-Report 06-01: F. Baader and A. Okhotin: On Language Equations with One-sided Concatenation

2005

LTCS-Report 05-10: H. Liu, C. Lutz, M. Milicic, and F. Wolter: Updating ABoxes
LTCS-Report 05-09: C. Lutz: Complexity and Succinctness of Public Announcement Logic
LTCS-Report 05-08: F. Baader, C. Lutz, E. Karabaev, and M. Theißen: A New n-ary Existential Quantifier in Description Logics
LTCS-Report 05-07: C. Lutz and M. Milicic: A Tableau Algorithm for DLs with Concrete Domains and GCIs
LTCS-Report 05-06: P. Bonatti, C. Lutz, F. Wolter: Expressive Non-Monotonic Description Logics Based on Circumscription
LTCS-Report 05-05: C. Lutz: PDL with Intersection and Converse is Decidable
LTCS-Report 05-04: F. Baader and S. Ghilardi: Connecting Many-Sorted Theories
LTCS-Report 05-03: C. Lutz, D. Walther, F. Wolter: Quantitative Temporal Logics: PSpace and Below
LTCS-Report 05-02: F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter: Integrating Description Logics and Action Formalisms for Reasoning about e-Services
LTCS-Report 05-01: F. Baader, S. Brandt, C. Lutz: Pushing the EL Envelope

2004

LTCS-Report 04-07: C. Lutz : /An Improved NExpTime-hardness result for the Description Logic ALC extended with Inverse Roles, Nominals, and Counting/
LTCS-Report 04-06: C. Lutz and M. Milicic: Description Logics with Concrete Domains and functional dependencies
LTCS-Report 04-05: C. Lutz, F. Wolter: Modal Logics of topological relations
LTCS-Report 04-04: S. Brandt: Subsumption and Instance Problem in ELH w.r.t. general TBoxes
LTCS-Report 04-03: S. Brandt: Reasoning in EL w.r.t. General TBoxes
LTCS-Report 04-02: F. Baader: /A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL/
LTCS-Report 04-01: B. Morawska: A nice Cycle Rule for Goal-Directed E-Unification

2003

LTCS-Report 03-05: F. Baader, S. Ghilardi, C. Tinelli: /A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics/
LTCS-Report 03-04: C. Lutz and D. Walther: PDL with Negation of Atomic Programs
LTCS-Report 03-03: B. Morawska: Completeness of E-unification with eager Variable Elimination
LTCS-Report 03-02: S. Brandt, A.-Y. Turhan, and R. Küsters: Foundations of Non-standard Inferences to Description Logics with transitive Roles
LTCS-Report 03-01: F. Baader: /The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics/

2002

LTCS-Report 02-07: F. Baader: /Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles/
LTCS-Report 02-06: I. Horrocks and U. Sattler: Description Logics with Complex Role Inclusion Axioms
LTCS-Report 02-05: C. Lutz, U. Sattler, and L. Tendera: The Complexity of Finite Model Reasoning in Description Logics
LTCS-Report 02-04: C. Areces, I. Horrocks, C. Lutz, and U. Sattler: Keys, Nominals, and Concrete Domains
LTCS-Report 02-03: S. Brandt and A.-Y. Turhan: An Approach for Optimizing ALE-Approximation of ALC-Concepts
LTCS-Report 02-02: F. Baader: Terminological Cycles in a Description Logic with Existential Restrictions
LTCS-Report 02-01: C. Lutz: Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies

2001

LTCS-Report 01-08: I. Horrocks and U. Sattler: Optimised Reasoning for SHIQ
LTCS-Report 01-07: C. Lutz: Adding Numbers to the SHIQ Description Logic-First Results
LTCS-Report 01-06: S. Brandt, R. Küsters, and A.-Y. Turhan: Approximation in Description Logics
LTCS-Report 01-05: F. Baader, R. Küsters: Unification in a Description Logic with Transitive Closure of Roles
LTCS-Report 01-04: C.Lutz, U. Sattler, and F. Wolter: Modal Logic and the Two-Variable Fragment
LTCS-Report 01-03: F. Baader and S. Tobies: The Inverse Methode Implements the Automata Approach for Modal Satisfiability
LTCS-Report 01-02: F. Baader, S. Brandt, and R. Küsters: Matching under Side Conditions in Description Logics
LTCS-Report 01-01: C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev: A Tableau Calculus for Temporal Description Logic: The Constant Domain Case

2000

LTCS-Report 00-07: R. Küsters and R. Molitor: Computing Least Common Subsumers in ALEN
LTCS-Report 00-06: C. Lutz: Interval-based Temporal Reasoning with General TBoxes
LTCS-Report 00-05: R. Küsters and R. Molitor: Computing Most Specific Concepts in Description Logics with Existential Restrictions
LTCS-Report 00-04: F. Baader, R. Küsters, and R. Molitor: Revised Version of "Rewriting Concepts Using Terminologies - Revisited "
LTCS-Report 00-03: C. Hirsch and S. Tobies: A Tabelaux Algorithm for the Clique Guarded Fragment
LTCS-Report 00-02: C. Lutz and U. Sattler: The Complexity of Reasoning with Boolean Modal Logics
LTCS-Report 00-01: C. Lutz: NExpTime-Complete Description Logics with Concrete Domains

1999

LTCS-Report 99-01: C. Lutz: The Complexity of Reasoning with Concrete Domains
LTCS-Report 99-02: M.-S. Hacid and C. Rigotti: Representing and Reasoning on Conceptual Queries Over Image Databases.
LTCS-Report 99-03: C. Decleir, M.-S. Hacid, and J. Kouloumdjian: A Database Approach for Modeling and Querying Video Data.
LTCS-Report 99-04: C. Lutz: On the Complexity of Terminological Reasoning.
LTCS-Report 99-05: S. Tobies: A Nexptime-complete Description Logic Strictly Contained in C\².
LTCS-Report 99-06: F. Baader and R. Molitor: Rewriting Concepts Using Terminologies.
LTCS-Report 99-07: F. Baader and R. Küsters: Matching in Description Logics with Existential Restrictions.
LTCS-Report 99-08: I. Horrocks, U. Sattler, and S. Tobies: /A Description Logic with Transitive and Converse Roles, Role Hierarchies, and Qualifying Number Restrictions/
LTCS-Report 99-09: S. Tobies: A PSpace-Algorithm for ALCQI Satisfiability
LTCS-Report 99-10: A. Artale and C. Lutz: A Correspondence between Temporal Description Logics
LTCS-Report 99-11: S. Tobies: PSpace Reasoning for DLs with Qualifying Number Restrictions
LTCS-Report 99-12: F. Baader , R. Küsters, and R. Molitor: Rewriting Concepts Using Terminologies - Revisited.
LTCS-Report 99-13: F. Baader and R. Küsters: Matching in Description Logics with Existential Restrictions - Revisited.
LTCS-Report 99-14: I. Horrocks and S. Tobies: Optimisation of Terminological Reasoning.
LTCS-Report 99-15: I. Horrocks, U. Sattler, S. Tessaris, and S. Tobies: Query Containment using a DLR ABox
LTCS-Report 99-16: S. Tobies: DLR Direct - A Tableaux Algorithm for DLR.

1998

LTCS-Report 98-01: C.B. Tresp and R. Molitor: A Description Logic coping with Vague Knowledge.
LTCS-Report 98-02: F. Baader and U. Sattler: Description Logics with Aggregates and Concrete Domains, Part II.
LTCS-Report 98-03: R. Molitor: Structural Subsumption for ALN.
LTCS-Report 98-04: R. Küsters and R. Molitor: Structural Subsumption Considered from an Automata-Theoretic Point of View.
LTCS-Report 98-05: I. Horrocks and U. Sattler: A Description Logic with Transitive and Converse Roles and Role Hierarchies.
LTCS-Report 98-06: R. Küsters: Computing the most specific concept w.r.t. cyclic ALN knowledge bases.
LTCS-Report 98-07: F. Baader and P. Narendran: Unification of Concept Terms in Description Logics (Revised version). Technical Report.
LTCS-Report 98-08: I. Horrocks and U. Sattler and S. Tobies: A PSpace-algorithm for deciding ALCNI\_R\^+-satisfiability.
LTCS-Report 98-09: F. Baader and R. Kuesters and R. Molitor: Least Common Subsumer in Description Logics with Existential Restrictions.
LTCS-Report 98-10: F.Baader, R. Molitor, and S. Tobies: The Guarded Fragment of Conceptual Graphs.
LTCS-Report 98-11: F. Baader and R. Molitor and S. Tobies: A Brief Look on the Relation between Conceptual Graphs and Description Logics.

1997

LTCS-Report 97-01: F. Baader and U. Sattler: Description Logics with Aggregates and Concrete Domains.
LTCS-Report 97-02: F. Baader and P. Narendran: Unification of Concept Terms in Description Logics. Technical Report.
LTCS-Report 97-03: F. Baader: On the Complexity of Boolean Unification. Technical Report.
LTCS-Report 97-04: R. Küsters: Characterizing the semantics of terminological cycles in ALN using finite automata. Technical Report.

1996

LTCS-Report 96-01: F. Baader and C. Tinelli: A New Approach for Combining Decision Prcedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method.
LTCS-Report 96-02: F. Baader and U. Sattler: Number Restrictions on Complex Roles in Description Logics. Technical Report. An abridged version has appeared in the Proceedings of the Fifth International Conference on Knowledge Representation and Reasoning, 1996, Cambridge, Massachusetts.
LTCS-Report 96-03: F. Baader and U. Sattler: Description Logics with Symbolic Number Restrictions. Technical Report. An abridged version has appeared in the Proceedings of the 12th European Conference on Artificial Intelligence, 1996, Budapest, Hungary.
LTCS-Report 96-05: F. Baader: Combination of Compatible Reduction Orderings that are Total on Ground Terms.