Highly acyclic groups, hypergraph covers, and the guarded fragment.

Published in: J. ACM (2012)

Keyphrases

satisfiability problem
guarded fragment
np hard
higher order
np complete
machine learning
database systems
natural language
computational complexity
xml documents
multi dimensional