Tractable and intractable classes of propositional schemata.

Nicolas Peltier

Published in: J. Log. Comput. (2014)

Keyphrases

np complete
computational complexity
propositional logic
databases
training data
first order logic
data sets
np hard
multi valued