Branching Bisimilarity on Normed BPA Is EXPTIME-complete.
Chaodong HeMingzhang HuangPublished in: CoRR (2015)
Keyphrases
- exptime complete
- description logics
- data complexity
- expressive power
- pspace complete
- expressive description logics
- np complete
- model checking
- transitive closure
- query containment
- reasoning tasks
- decision problems
- tree automata
- query answering
- satisfiability problem
- query evaluation
- conjunctive queries
- relational algebra
- knowledge base
- databases
- data exchange
- constraint satisfaction
- first order logic
- query optimization
- computational complexity
- regular path queries
- objective function