Monadic Logical Definability of NP-Complete Problems.

Etienne Grandjean Frédéric Olive

Published in: CSL (1994)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
deductive databases
propositional logic
sat problem
hard problems
satisfiability problem
combinatorial problems
reinforcement learning
decision problems
datalog programs
job shop scheduling
sufficient conditions