On the efficiency of normal form systems for representing Boolean functions

Miguel Couceiro 1 Erkko Lehtonen 2, 3 Pierre Mercuriali 4 Romain Péchoux 4
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
4 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : A normal form system (NFS) for representing Boolean functions is thought of as a set of stratified terms over a fixed set of connectives. For a fixed NFS A, the complexity of a Boolean function f with respect to A is the minimum of the sizes of terms in A that represent f. This induces a preordering of NFSs: an NFS A is polynomially as efficient as an NFS B if there is a polynomial P with nonnegative integer coefficients such that the complexity of any Boolean function f with respect to A is at most the value of P in the complexity of f with respect to B. In this paper we study monotonic NFSs, i.e., NFSs whose connectives are increasing or decreasing in each argument. We describe the monotonic NFSs that are optimal, i.e., that are minimal with respect to the latter preorder. We show that these minimal monotonic NFSs are all equivalent. Moreover, we address some natural questions, e.g.: does optimality depend on the arity of connectives? Does it depend on the number of connectives used? We show that optimal monotonic NFSs are exactly those that use a single connective or one connective and the negation. Finally, we show that optimality does not depend on the arity of the connectives.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

Contributor : Miguel Couceiro <>
Submitted on : Wednesday, June 12, 2019 - 11:51:37 AM
Last modification on : Friday, June 28, 2019 - 11:19:34 AM


Files produced by the author(s)


  • HAL Id : hal-02153506, version 1


Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux. On the efficiency of normal form systems for representing Boolean functions. 2019. ⟨hal-02153506⟩



Record views


Files downloads