Semantical Expansion of Two-Level Boolean Formulas for Minimisation
نویسنده
چکیده
Semantical expansion aims at boosting minimisation heuristics for Boolean formulas. It provides an easy way of deciding whether or not a given minterm, resp. clause, can be added safely to a formula in DNF, resp. CNF. We suggest to use incremental and complete SAT solvers and instances of UNSAT for these decisions, and report on some preliminary empirical results.
منابع مشابه
Geometry of Interaction for MALL via Hughes-vanGlabbeek Proof-Nets
This paper presents, for the first time, a Geometry of Interaction (GoI) interpretation using Hughes-vanGlabbeek (HvG) proof-nets for multiplicative additive linear logic (MALL). Our GoI captures dynamically HvG’s geometric correctness criterion–the toggling cycle condition–in terms of algebraic operators. Our new ingredient is a scalar extension of the *-algebra in Girard’s *-ring of partial i...
متن کاملOn some classes of expansions of ideals in $MV$-algebras
In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate and $ (tau,sigma)$-Boolean in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...
متن کاملThe Semantics of Rational Contractions
This paper is concerned with the revision of beliefs in the face of new and possibly contradicting information. In the Logic of Theory Change developed by Alchourron, Gärdenfors and Makinson this nonmonotonic process consists of a contraction and an expansion of a set of formulas. To achieve minimal change they formulated widely accepted postulates that rational contractions have to fulfill. Co...
متن کاملEfficient Calculation of the Reed-muller Form by Means of the Walsh Transform
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This pa...
متن کاملGeneralised k-variable-mixed-polarity Reed-Muller expansions for system of Boolean functions and their minimisation
A lookup table based method to minimise generalised partially-mixed-polarity ReedMuller (GPMPRM) expansions with k mixed polarity variables is presented. The developed algorithm can produce solutions based on the desired cost criteria for the systems of completely specified functions. A heuristic approach based on the exclusion rule is adopted to extract the best dual polarity variables from an...
متن کامل