Hochschulschrift
Complexity results and practical algorithms for logics in knowledge representation
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
II, 174 S.
- Sprache
-
Englisch
- Anmerkungen
-
Aachen, Techn. Hochsch., Diss., 2001 (Nicht für den Austausch)
- Schlagwort
-
Wissensrepräsentation
Terminologische Logik
Inferenz
Erfüllbarkeitsproblem
Tableau
Berechnungskomplexität
- Urheber
- 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:07 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)
Complexity results and practical algorithms for logics in knowledge representation
Guarded logics: algorithms and bisimulation
Guarded logics: algorithms and bisimulation
Randomness in complexity theory and logics
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
Subjective Representation of Complexity
The complexity of description logics with concrete domains
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
Fixed point logics and generalized quantifiers in descriptive complexity
Parameterized complexity of decision problems in non-classical logics
On the Complexity of Axiom Pinpointing in Description Logics
Complexity results and practical algorithms for logics in knowledge representation
Guarded logics: algorithms and bisimulation
Guarded logics: algorithms and bisimulation
Randomness in complexity theory and logics
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
Subjective Representation of Complexity
The complexity of description logics with concrete domains
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
Fixed point logics and generalized quantifiers in descriptive complexity
Parameterized complexity of decision problems in non-classical logics
On the Complexity of Axiom Pinpointing in Description Logics
Complexity results and practical algorithms for logics in knowledge representation
Guarded logics: algorithms and bisimulation
Guarded logics: algorithms and bisimulation
Randomness in complexity theory and logics
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
Subjective Representation of Complexity
The complexity of description logics with concrete domains
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
Fixed point logics and generalized quantifiers in descriptive complexity
Parameterized complexity of decision problems in non-classical logics