A decidable characterization of the classes between lintime and exptime.

Salvatore Caporaso

Published in: Inf. Process. Lett. (2006)

Keyphrases

description logics
first order logic
exptime complete
transitive closure
upper bound
tight complexity bounds
automata theoretic
expressive power
neural network
learning algorithm
artificial intelligence
logic programs
class labels
integrity constraints
decision problems
unions of conjunctive queries