- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
II, 216 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Aachen, Techn. Hochsch., Diss., 2002 (Nicht für den Austausch)
- Schlagwort
-
Wissensrepräsentation
Terminologische Logik
Erfüllbarkeitsproblem
Unentscheidbarkeit
Berechnungskomplexität
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:09 MESZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
The complexity of description logics with concrete domains
Description Logics with Aggregates and Concrete Domains
NExpTime-complete Description Logics with Concrete Domains
Description Logics with Concrete Domains and Functional Dependencies
Description Logics with Aggregates and Concrete Domains, Part II
Towards log-linear logics with concrete domains
On the Abstract Expressive Power of Description Logics with Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the Satisfiability of Temporal Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
The Complexity of Reasoning with Concrete Domains : Revised Version
The complexity of description logics with concrete domains
Description Logics with Aggregates and Concrete Domains
NExpTime-complete Description Logics with Concrete Domains
Description Logics with Concrete Domains and Functional Dependencies
Description Logics with Aggregates and Concrete Domains, Part II
Towards log-linear logics with concrete domains
On the Abstract Expressive Power of Description Logics with Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the Satisfiability of Temporal Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
The Complexity of Reasoning with Concrete Domains : Revised Version
The complexity of description logics with concrete domains
Description Logics with Aggregates and Concrete Domains
NExpTime-complete Description Logics with Concrete Domains
Description Logics with Concrete Domains and Functional Dependencies
Description Logics with Aggregates and Concrete Domains, Part II
Towards log-linear logics with concrete domains
On the Abstract Expressive Power of Description Logics with Concrete Domains : Extended Version
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
On the Satisfiability of Temporal Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version