Enumerating prime implicants of propositional formulae in conjunctive normal form

DOI10.1007/978-3-319-11558-0_11MaRDI QIDQ2938491zbMATH OpenOpenAlexFDO

Authors Said Jabbour, Lakhdar Sais, Yakoub Salhi, Joao Marques-Silva

Publication date 14 January 2015

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11558-0_11

Mathematics Subject Classification ID

Classical propositional logic (03B05) Combinatorics in computer science (68R05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Algorithms for selective enumeration of prime implicants
• CNF and DNF considered harmful for computing prime implicants/implicates
• An efficient algorithm to generate prime implicants
• scientific article; zbMATH DE number 517005
• Prime implicants of first order formulas via transversal clauses

Cites work

• 2006 and 2007 Max-SAT evaluations: contributed instances
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Algorithms for selective enumeration of prime implicants
• Characterizing diagnoses and systems
• Circuit Based Encoding of CNF Formula
• scientific article; zbMATH DE number 4106292 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• Measuring dissimilarity between judgment sets
• On Cores and Prime Implicants of Truth Functions
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• RST Flip-Flop Input Equations
• The Problem of Simplifying Truth Functions
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(12)

• An efficient algorithm to generate prime implicants
• CNF and DNF considered harmful for computing prime implicants/implicates
• Minimal sets on propositional formulae. Problems and reductions
• Computing maximal and minimal trap spaces of Boolean networks
• Propositional proof systems based on maximum satisfiability
• SAT-Based Formula Simplification
• Computing prime implicants via transversal clauses
• scientific article; zbMATH DE number 517005 (Why is no real title available?)
• Prime implicants of first order formulas via transversal clauses
• Temporal logic modeling of biological systems
• Implementing efficient All solutions SAT solvers
• On CNF conversion for SAT and SMT enumeration

This page was built for publication: Enumerating prime implicants of propositional formulae in conjunctive normal form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938491)