Enumeration Problems Related to Ground Horn Theories
Logic in Computer Science
2008-02-05 v2 Discrete Mathematics
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 variables for slightly different characterizations. The method of counting is via counting models using a satisfiability checker.
Cite
@article{arxiv.cs/0610054,
title = {Enumeration Problems Related to Ground Horn Theories},
author = {Nachum Dershowitz and Mitchell A. Harris and Guan-Shieng Huang},
journal= {arXiv preprint arXiv:cs/0610054},
year = {2008}
}
Comments
4 pages, before journal submission