2008
Franz Baader, Silvio Ghilardi, and Carsten Lutz.
LTL over Description Logic Axioms.
LTCS-Report 08-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2008.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
Franz Baader and Rafael Peñaloza.
Blocking and Pinpointing in Forest Tableaux.
LTCS-Report 08-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2008.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
Franz Baader and Rafael Peñaloza.
Pinpointing in Terminating Forest Tableaux.
LTCS-Report 08-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2008.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
Felix Distel.
Model-based Most Specific Concepts in Description Logics with Value
Restrictions.
LTCS-Report 08-04, Institute for theoretical computer science, TU Dresden,
Dresden, Germany, 2008.
http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex
entry Abstract
Paper
(PS) Paper
(PDF)
Franz Baader and Felix Distel.
Exploring finite models in the Description Logic
EL_gfp.
LTCS-Report 08-05, Institute for Theoretical Computer Science, TU Dresden,
Dresden, 2008.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
Baris Sertkaya.
Some Computational Problems Related to Pseudo-intents.
LTCS-Report 08-06, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2008.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex
entry Abstract
Paper (PS) Paper
(PDF)
2007
Franz Baader and Rafael Penaloza.
Axiom Pinpointing in General Tableaux.
LTCS-Report 07-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS) Paper (PDF)
Franz Baader and Felix Distel.
A finite basis for the set of EL-implications holding in a finite
model.
LTCS-Report 07-02, Inst. für Theoretische Informatik, TU Dresden, Dresden,
Germany, 2007.
Bibtex
entry Abstract
Paper
(PDF)
Boontawee Suntisrivaraporn.
Module Extraction and Incremental Classification: A Pragmatic Approach for
EL+ Ontologies.
LTCS-Report 07-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2007.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper
(PDF)
2006
Franz Baader and Alexander Okhotin.
On Language Equations with One-sided Concatenation.
LTCS-Report 06-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS) Paper (PDF)
Franz Baader, Bernhard Ganter, Ulrike Sattler, and Baris Sertkaya.
Completing Description Logic Knowledge Bases using Formal Concept
Analysis.
LTCS-Report 06-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
H. Liu, C. Lutz, M. Milicic, and F. Wolter.
Description Logic Actions with general TBoxes: a Pragmatic
Approach.
LTCS-Report 06-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PDF)
F. Baader, J. Hladik, and R. Penaloza.
PSPACE Automata with Blocking for Description Logics.
LTCS-Report 06-04, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PDF)
Rafael Penaloza.
Pinpointing in Tableaus.
LTCS-Report 06-05, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2006.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
2005
F. Baader, S. Brandt, and C. Lutz.
Pushing the EL Envelope.
LTCS-Report 05-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
F. Baader, M. Milicic, C. Lutz, U. Sattler, and F. Wolter.
Integrating Description Logics and Action Formalisms for Reasoning about
Web Services.
LTCS-Report 05-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
C. Lutz, D. Walther, and F. Wolter.
Quantitative Temporal Logics: PSpace and below.
LTCS-Report 05-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
Franz Baader and Silvio Ghilardi.
Connecting Many-Sorted Theories.
LTCS-Report 05-04, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz.
PDL with Intersection and Converse is Decidable.
LTCS-Report 05-05, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
P. Bonatti, C. Lutz, and F. Wolter.
Expressive Non-Monotonic Description Logics Based on Circumscription.
LTCS-Report 05-06, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz and M. Milicic.
A Tableau Algorithm for DLs with Concrete Domains and GCIs.
LTCS-Report 05-07, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
Franz Baader, Carsten Lutz, Eldar Karabaev, and Manfred Theißen.
A New n-ary Existential Quantifier in Description Logics.
LTCS-Report 05-08, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
C. Lutz.
Complexity and Succinctness of Public Announcement Logic.
LTCS-Report 05-09, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
H. Liu, C. Lutz, M. Milicic, and F. Wolter.
Updating Description Logic ABoxes.
LTCS-Report 05-10, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2005.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
2004
B. Morawska.
A nice Cycle Rule for Goal-Directed E-Unification.
LTCS-Report 04-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
F. Baader.
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most
Specific Concept in the Description Logic EL.
LTCS-Report 04-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
S. Brandt.
Reasoning in ELH w.r.t. General Concept Inclusion Axioms.
LTCS-Report 04-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
S. Brandt.
Subsumption and Instance Problem in ELH w.r.t. General
TBoxes.
LTCS-Report 04-04, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PDF)
C. Lutz and F. Wolter.
Modal Logics of Topological Relations.
LTCS-Report 04-05, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
C. Lutz and M. Milicic.
Description Logics with Concrete Domains and Functional Dependencies.
LTCS-Report 04-06, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2004.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS) Paper (PDF)
2003
F. Baader.
The Instance Problem and the Most Specific Concept in the Description Logic
w.r.t. Terminological Cycles with Descriptive Semantics.
LTCS-Report 03-01, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2003.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
S. Brandt, A.-Y. Turhan, and R. Küsters.
Foundations of non-standard Inferences for Description Logics with
transitive Roles and Role Hierarchies.
LTCS-Report 03-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2003.
Bibtex entry Abstract Paper (PS)
B. Morawska.
Completness of E-unification with eager Variable Elimination.
LTCS-Report 03-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2003.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
C. Lutz and D. Walther.
PDL with Negation of Atomic Programs.
LTCS-Report 03-04, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2003.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
F. Baader, Silvio Ghilardi, and Cesare Tinelli.
A New Combination Procedure for the Word Problem that Generalizes Fusion
Decidability Results in Modal Logics.
LTCS-Report 03-05, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2003.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
2002
C. Lutz.
Reasoning about Entity Relationship Diagrams with Complex Attribute
Dependencies.
LTCS-Report 02-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2002.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
F. Baader.
Terminological Cycles in a Description Logic with Existential
Restrictions.
LTCS-Report 02-02, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
S. Brandt and A.-Y. Turhan.
An Approach for Optimizing ALE-Approximation of ALC-Concepts.
LTCS-Report 02-03, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz, C. Areces, I. Horrocks, and U. Sattler.
Keys, Nominals, and Concrete Domains.
LTCS-Report 02-04, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz, U. Sattler, and L. Tendera.
The Complexity of Finite Model Reasoning in Description Logics.
LTCS-Report 02-05, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
I. Horrocks and U. Sattler.
Decidability of SHIQ with Complex Role Inclusion Axioms.
LTCS-Report 02-06, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract
Paper (PS)
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-07, Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology, Germany, 2002.
See http://lat.inf.tu-dresden.de/research/reports.html.
Bibtex entry Abstract Paper (PS)
2001
C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev.
A Tableau Calculus for Temporal Description Logic: The Constant Domain
Case.
LTCS-Report 01-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
F. Baader, S. Brandt, and R. Küsters.
Matching under Side Conditions in Description Logics.
LTCS-Report 01-02, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
F. Baader and S. Tobies.
The Inverse Method Implements the Automata Approach for Modal
Satisfiability.
LTCS-Report 01-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz, U. Sattler, and F. Wolter.
Modal Logic and the two-variable fragment.
LTCS-Report 01-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
F. Baader and R. Küsters.
Unification in a Description Logic with Transitive Closure of Roles.
LTCS-Report 01-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
S. Brandt, R. Küsters, and A.-Y. Turhan.
Approximation and Difference in Description Logics.
LTCS-Report 01-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
Bibtex entry Abstract
Paper (PS)
C. Lutz.
Adding Numbers to the SHIQ Description Logic—First Results.
LTCS-Report 01-07, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
I. Horrocks and U. Sattler.
Optimised Reasoning for SHIQ.
LTCS-Report 01-08, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2001.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
2000
C. Lutz.
NExpTime-complete Description Logics with Concrete Domains.
LTCS-Report 00-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
C. Lutz and U. Sattler.
The Complexity of Reasoning with Boolean Modal Logics (Extended
Version).
LTCS-Report 00-02, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
C. Hirsch and S. Tobies.
A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary
Version.
LTCS-Report 00-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Paper (PS)
F. Baader, R. Küsters, and R. Molitor.
Rewriting Concepts Using Terminologies – Revisited.
LTCS-Report 00-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
R. Küsters and R. Molitor.
Computing Most Specific Concepts in Description Logics with Existential
Restrictions.
LTCS-Report 00-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
Bibtex entry Abstract
Paper (PS)
C. Lutz.
Interval-based Temporal Reasoning with General TBoxes.
LTCS-Report 00-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
R. Küsters and R. Molitor.
Computing Least Common Subsumers in ALEN.
LTCS-Report 00-07, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
1999
C. Lutz.
The Complexity of Reasoning with Concrete Domains (Revised Version).
LTCS-Report 99-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract Paper (PS)
M.-S. Hacid and C. Rigotti.
Representing and Reasoning on Conceptual Queries Over Image
Databases.
LTCS-Report 99-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract
Paper (PS)
C. Decleir, M.-S. Hacid, and J. Kouloumdjian.
A Database Approach for Modeling and Querying Video Data.
LTCS-Report 99-03, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract
Paper (PS)
C. Lutz.
On the Complexity of Terminological Reasoning.
LTCS-Report 99-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
This report is superceded by the LTCS-00-01 technical report and my LPAR'99
paper.
Bibtex entry Abstract
S. Tobies.
A NEXPTIME-complete Description Logic Strictly Contained in C^2.
LTCS-Report 99-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
An abriged version appeared at CSL-99.
Bibtex entry Abstract Paper (PS)
F. Baader and R. Molitor.
Rewriting Concepts using Terminologies.
LTCS-Report 99-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
F. Baader and R. Küsters.
Matching in Description Logics with Existential Restrictions.
LTCS-Report 99-07, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
I. Horrocks, U. Sattler, and S. Tobies.
A Description Logic with Transitive and Converse Roles, Role Hierarchies
and Qualifying Number Restrictions.
LTCS-Report 99-08, LuFG Theoretical Computer Science, RWTH Aachen, 1999.
Revised version. See
http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
S. Tobies.
A PSpace-algorithm for ALCQI-satisfiability.
LTCS-Report 99-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract Paper (PS)
S. Tobies.
PSpace Reasoning for DLs with Qualifying Number Restrictions.
LTCS-Report 99-11, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract Paper (PS)
F. Baader, R. Küsters, and R. Molitor.
Rewriting Concepts Using Terminologies – Revisited.
LTCS-Report 99-12, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
Please refer to the revised version LTCS-Report 00-04.
Bibtex entry Abstract Paper (PS)
F. Baader and R. Küsters.
Matching Concept Descriptions with Existential Restrictions Revisited.
LTCS-Report 99-13, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
I. Horrocks and S. Tobies.
Optimisation of Terminological Reasoning.
LTCS-Report 99-14, LuFG Theoretical Computer Science, RWTH Aachen, 1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
I. Horrocks, U. Sattler, S. Tessaris, and S. Tobies.
Query Containment Using a DLR ABox.
LTCS-Report 99-15, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1999.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
1998
C.B. Tresp and R. Molitor.
A Description Logic for Vague Knowledge.
LTCS-Report 98-01, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1998.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract
Paper (PS)
F. Baader and U. Sattler.
Description Logics with Aggregates and Concrete Domains, Part II
(extended).
LTCS-Report 98-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Bibtex entry Paper (PS)
R. Molitor.
Structural Subsumption for ALN.
LTCS-Report 98-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Bibtex entry Paper (PS)
F. Baader, R. Küsters, and R. Molitor.
Structural Subsumption Considered from an Automata Theoretic Point of
View.
LTCS-Report 98-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Abstract Paper (PS)
I. Horrocks and U. Sattler.
A Description Logic with Transitive and Converse Roles and Role
Hierarchies.
LTCS-Report 98-05, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Bibtex entry Paper (PS)
F. Baader and R. Küsters.
Computing the least common subsumer and the most specific concept in the
presence of cyclic ALN-concept descriptions.
LTCS-Report 98-06, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Bibtex entry Abstract
Paper (PS)
F. Baader and P. Narendran.
Unification of Concept Terms in Description Logics: Revised Version.
LTCS-Report 98-07, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Bibtex entry Abstract
Paper (PS)
I. Horrocks, U. Sattler, and S. Tobies.
A PSpace-algorithm for deciding ALCNI_R^+-satisfiability.
LTCS-Report 98-08, LuFG Theoretical Computer Science, RWTH Aachen, 1998.
Bibtex entry Abstract Paper (PS)
F. Baader, R. Küsters, and R. Molitor.
Computing Least Common Subsumers in Description Logics with Existential
Restrictions.
LTCS-Report 98-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract Paper (PS)
F. Baader, R. Molitor, and S. Tobies.
The Guarded Fragment of Conceptual Graphs.
LTCS-Report 98-10, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
Bibtex entry Abstract
Paper (PS)
F. Baader, R. Molitor, and S. Tobies.
On the Relation between Descripion Logics and Conceptual Graphs.
LTCS-Report 98-11, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Bibtex entry Paper (PS)
1997
F. Baader and U. Sattler.
Description Logics with Aggregates and Concrete Domains.
LTCS-Report 97-01, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1997.
An abridged version has appeared in the Proceedings of the International
Workshop on Description Logics 97.
Bibtex entry Abstract Paper (PS)
F. Baader and P. Narendran.
Unification of Concept Terms in Description Logics.
LTCS-Report 97-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1997.
Bibtex entry Abstract
Paper (PS)
F. Baader.
On the Complexity of Boolean Unification.
LTCS-Report 97-03, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1997.
Bibtex entry Abstract Paper (PS)
R. Küsters.
Characterizing the semantics of terminological cycles in ALN
using finite automata.
LTCS-Report 97-04, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1997.
Bibtex entry Abstract Paper (PS)
M. S. Hacid, P. Marcel, and C. Rigotti.
A rule based data manipulation language for OLAP systems.
LTCS-Report 97-05, LuFg Theoretical Computer Science, RWTH Aachen, 1997.
A short version has appeared in the Proceedings of the 5th International
Conference on Deductive and Object-Oriented Databases (DOOD'97), Montreux,
Switzerland.
Bibtex entry Abstract Paper (PS)
1996
F. Baader and C. Tinelli.
A New Approach for Combining Decision Procedures for the Word Problem, and
Its Connection to the Nelson-Oppen Combination Method.
LTCS-Report 96-01, LuFg Theoretical Computer Science, RWTH Aachen, 1996.
An abridged version has appeared in Proc. CADE'97, Springer LNAI 1249.
Bibtex entry Abstract Paper (PS)
F. Baader and U. Sattler.
Number Restrictions on Complex Roles in Description Logics.
LTCS-Report 96-02, LuFg Theoretical Computer Science, RWTH Aachen, 1996.
An abridged version has appeared in the Proceedings of the Fifth International
Conference on Knowledge Representation and Reasoning, 1996, Cambridge,
Massachusetts.
Bibtex entry Paper (PS)
F. Baader and U. Sattler.
Description Logics with Symbolic Number Restrictions.
LTCS-Report 96-03, LuFg Theoretical Computer Science, RWTH Aachen, 1996.
An abridged version has appeared in the Proceedings of the 12th European
Conference on Artificial Intelligence, 1996, Budapest, Hungary.
Bibtex entry Paper (PS)
S. Kepser and J. Richts.
Optimisation Techniques for Combining Constraint Solvers.
LTCS-Report 96-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1996.
Bibtex entry Abstract Paper (PS)
F. Baader.
Combination of Compatible Reduction Orderings that are Total on Ground
Terms.
LTCS-Report 96-05, LuFg Theoretical Computer Science, RWTH Aachen, Germany,
1996.
Bibtex entry Abstract Paper (PS)
Back to the homepage of the Chair for Automata Theory.