Axiomatisability and hardness for universal Horn classes of hypergraphs
Combinatorics
2022-06-23 v1 Computational Complexity
Discrete Mathematics
Logic in Computer Science
Logic
Abstract
We characterise finite axiomatisability and intractability of deciding membership for universal Horn classes generated by finite loop-free hypergraphs.
Keywords
Cite
@article{arxiv.1704.02099,
title = {Axiomatisability and hardness for universal Horn classes of hypergraphs},
author = {Lucy Ham and Marcel Jackson},
journal= {arXiv preprint arXiv:1704.02099},
year = {2022}
}