# LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

arXiv: https://arxiv.org/abs/2011.04928 · HTML: https://mlsanity.com/paper/2011.04928/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Nov 2020.

## Built on by (most cited first, 1 of 1)

- [When Can a Machine Trust a Statute? A Survival Certificate for Machine-Extracted Legal Logic](https://mlsanity.com/paper/2609.01741/) (2026)

## Abstract (arXiv)

We propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines Close-by-One and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Our experimental evaluation shows that it is the most efficient algorithm for computation of the Duquenne-Guigues basis.