An Efficient Algorithm for Representing Piecewise Linear Functions into Logic
Sandro Márcio da Silva Preto, Marcelo Finger · Electronic Notes in Theoretical Computer Science · 2020
Rational McNaughton functions may be implicitly represented by logical formulas in Łukasiewicz Infinitely-valued Logic by constraining the set of valuations to the ones that satisfy some specific formulas. This work investigates this implicit representation called representation modulo satisfiability and describes a polynomial algorithm that builds it — the representative formula and the constraining ones — for a given rational McNaughton function.