no code implementations • 20 May 2023 • Sophie Blum, Raoul Koudijs, Ana Ozaki, Samia Touileb
We propose a new algorithm that aims at extracting the "tightest Horn approximation" of the target theory and that is guaranteed to terminate in exponential time (in the worst case) and in polynomial time if the target has polynomially many non-Horn examples.
