Badran Raddaoui

Computational Theory and Mathematics · 2018

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Badran Raddaoui trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Carsten Sinz
  2. Niklas Eén

Papers from Badran Raddaoui's perspective

Ordered by how strongly the researchers Badran Raddaoui trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A Structure-Preserving Clause Form Translation
  2. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
  3. Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (Computational Logic)
  4. Translating Pseudo-Boolean Constraints into SAT (Journal on Satisfiability, Boolean Modeling and Computation)
  5. On the Complexity of Derivation in Propositional Calculus
  6. Efficient CNF Encoding of Boolean Cardinality Constraints
  7. Cha : Engineering an e cient SAT solver (Design Automation Conference)
  8. A machine program for theorem-proving (CACM)
  9. Temporal induction by incremental SAT solving (BMC@CAV)
  10. The Art of Computer Programming: Volume 3: Sorting and Searching

Their papers