Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates.
Clemens LautemannPublished in: CSL (1992)
Keyphrases
- optimization problems
- datalog programs
- evolutionary algorithm
- metaheuristic
- cost function
- objective function
- propositional logic
- traveling salesman problem
- fixed point
- probabilistic logic
- deductive databases
- benchmark problems
- np complete
- combinatorial optimization
- computational complexity
- np hard
- logical reasoning
- query answering
- logical representation
- optimization methods
- logical structure
- special case
- logical operations
- datalog queries
- truth table