Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete.
Aaron LyePublished in: LATA (2021)
Keyphrases
- np complete
- np hard
- grammatical inference
- randomly generated
- context free
- context free grammars
- satisfiability problem
- context free languages
- pspace complete
- expressive power
- natural language
- closure properties
- grammar induction
- higher order
- language independent
- special case
- databases
- np complete problems
- computational complexity
- conjunctive queries
- data fusion
- automatically generated
- branch and bound algorithm
- natural language processing
- pairwise
- text summarization
- bounded treewidth
- context sensitive
- polynomially solvable
- visual languages