Automata can show PSpace results for description logics.
Franz BaaderJan HladikRafael PeñalozaPublished in: Inf. Comput. (2008)
Keyphrases
- description logics
- knowledge base
- knowledge representation
- finite automata
- reasoning tasks
- finite state
- exptime complete
- tree automata
- computing least common subsumers
- computational properties
- semantic web
- dl lite
- reasoning problems
- knowledge representation and reasoning
- decision procedures
- ontology languages
- regular expressions
- knowledge representation systems
- pspace complete
- combined complexity
- reasoning systems
- temporal logic
- knowledge representation formalisms
- fuzzy description logics
- finite state machines
- owl ontologies
- concept descriptions
- dl programs
- owl dl