Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

DOI10.1007/978-3-319-11558-0_11zbMath1432.68327OpenAlexW149544036MaRDI QIDQ2938491

Yakoub Salhi, Saïd Jabbour, Lakhdar Saïs, João P. 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

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

Related Items (6)

SAT-Based Formula Simplification ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Propositional proof systems based on maximum satisfiability ⋮ Computing maximal and minimal trap spaces of Boolean networks ⋮ Temporal Logic Modeling of Biological Systems ⋮ Implementing Efficient All Solutions SAT Solvers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing diagnoses and systems
• Algorithms for selective enumeration of prime implicants
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Measuring Dissimilarity between Judgment Sets
• Circuit Based Encoding of CNF Formula
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• RST Flip-Flop Input Equations
• On Cores and Prime Implicants of Truth Functions
• Theory and Applications of Satisfiability Testing
• The Problem of Simplifying Truth Functions

This page was built for publication: Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form