Branching Bisimilarity on Normed BPA Is EXPTIME-Complete.
Chaodong HeMingzhang HuangPublished in: LICS (2015)
Keyphrases
- exptime complete
- description logics
- data complexity
- expressive power
- pspace complete
- expressive description logics
- np complete
- decision problems
- transitive closure
- model checking
- query containment
- query answering
- tree automata
- knowledge base
- query evaluation
- data exchange
- satisfiability problem
- query language
- query complexity
- incomplete information
- regular expressions
- finite state
- first order logic
- reasoning tasks
- knowledge representation
- probability distribution
- relational databases
- machine learning