- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
29 S.
- Sprache
-
Deutsch
- Anmerkungen
-
Literaturverz. S. 26 - 29
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern, Saarbrücken
- (wer)
-
DFKI
- (wann)
-
1991
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 11:53 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Baader, Franz
- Hanschke, Philipp
- DFKI
Entstanden
- 1991
Ähnliche Objekte (12)
Description Logics with Aggregates and Concrete Domains
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the combination of symbolic constraints, solution domains, and constraint solvers
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints
On the Complexity of Boolean Unification
Description Logics with Aggregates and Concrete Domains
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the combination of symbolic constraints, solution domains, and constraint solvers
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints
On the Complexity of Boolean Unification
Description Logics with Aggregates and Concrete Domains
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the combination of symbolic constraints, solution domains, and constraint solvers
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints