The coherence of Lukasiewicz assessments is NP-complete.
Simone BovaTommaso FlaminioPublished in: Int. J. Approx. Reason. (2010)
Keyphrases
- np complete
- np hard
- satisfiability problem
- modal logic
- constraint satisfaction problems
- randomly generated
- computational complexity
- conjunctive queries
- polynomial time complexity
- pspace complete
- np complete problems
- polynomially solvable
- data mining
- data complexity
- database
- bounded treewidth
- conp complete
- finds an optimal solution
- desirable properties
- phase transition
- evolutionary algorithm
- neural network