no code implementations • 2 Feb 2022 • Pierre Carbonnelle, Matthias van der Hallen, Marc Denecker
To avoid nonsensical sentences in this formalism, we refine the concept of well-formed sentences, and propose a method to verify well-formedness with a complexity that is linear with the number of tokens in the formula.
no code implementations • 31 Aug 2016 • Matthias van der Hallen, Sergey Paramonov, Michael Leuschel, Gerda Janssens
For IDP and ASP, which have no native support for higher order logic, we propose the use of encoding techniques such as the disjoint union technique and the saturation technique.