An exact solution to the minimum size test pattern problem
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
On applying cutting planes in DLL-Based algorithms for pseudo-boolean optimization
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Approximate boolean reasoning approach to rough sets and data mining
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Counting models in integer domains
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Minimum satisfying assignments for SMT
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
| Hi-index | 0.00 |
An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solutions. The method allows to implement preference criteria in the choice of the prime implicants to find. Keywords. Integer programming, prime implicants, hypothetical reasoning, explanations.