Axiomatisability and hardness for universal Horn classes of hypergraphs

Abstract

We characterise finite axiomatisability and intractability of deciding membership for universal Horn classes generated by finite loop-free hypergraphs.

References in corpus (2)

• Asking the metaquestions in constraint tractability
• All or nothing: toward a promise problem dichotomy for constraint problems

Cited by in corpus (3)

• From $A$ to $B$ to $Z$
• Graph Homomorphism Reconfiguration and Frozen $H$-Colourings
• Finite models for positive combinatorial and exponential algebra