@TechReport{TrespMolitor-LTCS-98-01,
author = {C.B.~Tresp and R.~Molitor},
title = {A Description Logic for Vague Knowledge},
institution = {LuFg Theoretical Computer Science, RWTH Aachen},
type = {LTCS-Report},
number = {LTCS-98-01},
year = {1998},
address = {Germany},
issuedate = {January 1998},
note = {See
http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html}}
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.
Paper (PS)
@TechReport{BaSat98,
author = {Baader, F. and Sattler, U.},
title = {Description Logics with Aggregates and Concrete Domains, Part II (extended)},
institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-02}
}
R. Molitor.
Structural Subsumption for ALN.
LTCS-Report 98-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
1998.
Paper (PS)
@TechReport{Molitor-LTCS-98-03,
author = {R. Molitor},
title = {Structural {S}ubsumption for {$\cal A\!L\!N$}},
institution = {LuFG Theoretical Computer Science, RWTH Aachen, Germany},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-03}
}
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.
Abstract Paper (PS)
@TechReport{BaaderKuestersMolitor-LTCS-98-04,
author = {F. Baader and R. K{\"u}sters and R. Molitor},
title = {Structural Subsumption Considered from an Automata
Theoretic Point of View},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-04},
address = {Germany},
issuedate = {June 1998},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
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.
Paper (PS)
@TechReport{HoSat98,
author = {Horrocks, I. and Sattler, U.},
title = {A Description Logic with Transitive and Converse Roles and Role Hierarchies},
institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-05}
}
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.
Abstract Paper (PS)
@TechReport{BaaderKuesters-LTCS-98-06-1998,
author = {F. Baader and R. K{\"u}sters},
title = {Computing the least common subsumer and the most specific concept
in the presence of cyclic ALN-concept descriptions},
institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
year = 1998,
type = {LTCS-Report},
ccl = {yes},
number = {LTCS-98-06},
}
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.
Abstract Paper (PS)
@TECHREPORT{Baader-Narendran-LTCS-98,
author = {F. Baader and P. Narendran},
title = {Unification of Concept Terms in Description Logics: Revised Version},
institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-07},
ccl = {yes}
}
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.
Abstract Paper (PS)
@TechReport{HoSatTob98,
author = {I. Horrocks and U. Sattler and S. Tobies},
title = {A PSpace-algorithm for deciding
ALCNI_{R^+}-satisfiability},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-08},
issuedate = { October 1, 1998},
keywords = { Description Logic, Complexity }
}
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.
Abstract Paper (PS)
@TechReport{BaaderKuesters+-LTCS-98-09,
author = {F.~Baader and R.~K{\"u}sters and R.~Molitor},
title = {Computing Least Common Subsumers in Description Logics with
Existential Restrictions},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 1998,
type = {LTCS-Report},
number = {LTCS-98-09},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.}
}
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.
Abstract Paper (PS)
@TechReport{Baader-Molitor-Tobies-LTCS-98a,
author = {F.~Baader and R.~Molitor and S.~Tobies},
title = {The Guarded Fragment of Conceptual Graphs},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 1998,
type = {LTCS-Report},
address = {Germany},
number = {LTCS-98-10},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
keywords = {Guarded Fragment, Conceptual Graphs},
issuedate = {November 10, 1998}
}
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.
Paper (PS)
@TechReport{BaaderMolitorTobies-LTCS-98-11,
author = {F.~Baader and R.~Molitor and S.~Tobies},
title = {On the Relation between Descripion Logics and Conceptual Graphs},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
type = {LTCS-Report},
number = {LTCS-98-11},
year = 1998,
address = {Germany},
issuedate = {June 1998},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
Back to the homepage of the Chair for Automata Theory.