
All this material is related to the paper:

Counting finite linearly ordered involutive bisemilattices.
Authors: Stefano Bonzio, Michele Pra Baldi, and Diego Valota.

The paper describes an algorithm that takes as input a natural number n
and counts the number of LIBSLs of cardinality n.


This folder contains:

- README.txt, this file;
- Prover9/ a folder containing a FO theory of LIBSL and files created
with Mace4/isofilter containing all the non-isomorphic LIBSLs of cardinality <=11
(we have not included the original Mace4 files because of their dimension, ~180MB);
- files libslN-M.txt, libslK.txt the shapes of LIBSLs computed with our algorithm;
- countLIBSL.py a python implementation of the algorithm.

The script has to be used in the following way:

	 python ./countLIBSL.py s e

	the script computes the number of LIBSLs from cardinality s to cardinality e
	where s>0 and e>0 are natural numbers


