Formal concept analysis

RULEBASIS

compute the canonical basis of implications (Duquenne-Guigues)

Usage

java -jar fca4j-cli.jar RULEBASIS <input> [<output-file>] [options]

Option	Description
`-clarify`	this option can speed up the execution by basing the calculation on the clarified context
`-a <ALGO>`	supported algorithms are `LINCBO` `LINCBOPRUNING (default)`
`-c <CLOSURE>`	two methods to perform the closure operation are available `BASIC (default)` `WITH_HISTORY`
`-t <POOL-MODE>`	multithreading options are: `MONO (default)` `FORKJOINPOOL`
`-h <THRESHOLD>`	multithreading limit size of work for a task default=50
`-b`	sort implications by ascending support
`-r <REPORTFILE>`	generate report about algorithm execution
`-folder <PATH>`	folder to generate a file by support for results
`-i <INPUT-FORMAT>`	supported formats are: `CXT (Burmeisters ConImp)` `SLF (HTK Standard Latice Format)` `XML (Galicia v3)` `CEX (ConExp)` `CSV (Comma separated values)`
`-o <OUTPUT-FORMAT>`	supported formats are: `TXT (default)` `JSON` `XML` `DATALOG`
`-m <IMPL>`	supported implementations are `BITSET (default)` `ROARING_BITMAP` `SPARSE_BITSET` `TREESET` `INT_ARRAY` `ARRAYLIST` `BOOL_ARRAY`
`-s <SEPARATOR>`	separator (CSV format only): `COMMA (default)` `SEMICOLON` `TAB`
`-timeout <SECONDS>`	set timeout for algorithm execution, in seconds
`-v, --verbose`	print a final report of the algorithm execution