Deciding the Closure of Inconsistent Rooted Triples is NP-Complete.
Matthew P. JohnsonPublished in: CoRR (2018)
Keyphrases
- np complete
- np hard
- linked data
- randomly generated
- satisfiability problem
- constraint satisfaction problems
- computational complexity
- polynomial time complexity
- polynomially solvable
- pspace complete
- phase transition
- inconsistent information
- conjunctive queries
- special case
- np complete problems
- computationally complex
- neural network
- relational databases
- information systems
- bounded treewidth
- genetic algorithm