Hochschulschrift
Complexity results and practical algorithms for logics in knowledge representation
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Language
-
Englisch
- Notes
-
Aachen, Techn. Hochsch., Diss., 2001
- Keyword
-
Wissensrepräsentation
Terminologische Logik
Inferenz
Erfüllbarkeitsproblem
Tableau
Berechnungskomplexität
- Creator
- URN
-
urn:nbn:de:hbz:82-opus-1702urn:nbn:de:hbz:82-20010829
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
Other Objects (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
Subjective Representation of Complexity
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
The complexity of description logics with concrete domains
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity
Fixed point logics and generalized quantifiers in descriptive complexity
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
Subjective Representation of Complexity
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
The complexity of description logics with concrete domains
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity
Fixed point logics and generalized quantifiers in descriptive complexity
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
Subjective Representation of Complexity
On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
On the complexity of fragments of nonmonotonic logics
The complexity of description logics with concrete domains
The complexity of description logics with concrete domains
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity