Enumeration Problems Related to Ground Horn Theories
Abstract
We investigate the enumeration of varieties of boolean theories related to Horn clauses. We describe a number of combinatorial equivalences among different characterizations and calculate the number of different theories in $n$ variables for slightly different characterizations. The method of counting is via counting models using a satisfiability checker.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2006
- DOI:
- 10.48550/arXiv.cs/0610054
- arXiv:
- arXiv:cs/0610054
- Bibcode:
- 2006cs.......10054D
- Keywords:
-
- Computer Science - Logic in Computer Science;
- Computer Science - Discrete Mathematics;
- F.4.1
- E-Print:
- 4 pages, before journal submission