A Completeness Theorem for the Expressive Power of Higher-Order Algebraic Specifications.

Published in: J. Comput. Syst. Sci. (1997)

Keyphrases

expressive power
higher order
first order logic
data complexity
query language
transitive closure
computational properties
markov random field
pairwise
relational algebra
high level
relational calculus
formal specification
np complete
databases
search algorithm
artificial intelligence