Login / Signup
The Complexity of Definability by Open First-Order Formulas.
Carlos Areces
Miguel Campercholi
Daniel Penazzi
Pablo Ventura
Published in:
CoRR (2019)
Keyphrases
</>
first order logic
higher order
fixed point
computational complexity
worst case
horn clauses
data sets
space complexity
finite model theory
genetic algorithm
sufficient conditions
propositional logic
expressive power
decision problems
propositional formulas
inductive logic programming systems