The complexity of definability by open first-order formulas.

Carlos Areces Miguel Campercholi Daniel Penazzi Pablo Ventura

Published in: Log. J. IGPL (2020)

Keyphrases

first order logic
propositional logic
finite model theory
space complexity
action theories
data sets
neural network
bayesian networks
worst case
sufficient conditions
quantifier free