A Characterisation of Definable NP Search Problems in Peano Arithmetic.
Arnold BeckmannPublished in: WoLLIC (2009)
Keyphrases
- search problems
- orders of magnitude
- search algorithm
- heuristic search
- efficient search
- search space
- state space search
- search strategies
- solving hard
- iterative deepening
- np complete
- constraint satisfaction problems
- parallel processors
- computational complexity
- heuristic search algorithms
- answer sets
- first order logic
- np hard
- planning problems
- general purpose
- probabilistic model
- evolutionary algorithm
- systematic search algorithms