Saïd Jabbour

Computational Theory and Mathematics · 2009–2018

A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Saïd Jabbour trusts overall

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

  1. Niklas Eén
  2. Carsten Sinz
  3. Niklas Sörensson
  4. Robert Nieuwenhuis
  5. Matthew W. Moskewicz

Who trusts Saïd Jabbour overall

  1. Henrik E. C. Cao

Papers from Saïd Jabbour's perspective

Ordered by how strongly the researchers Saïd Jabbour trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A machine program for theorem-proving (CACM)
  2. A Structure-Preserving Clause Form Translation
  3. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
  4. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
  5. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
  6. Z3: An Efficient SMT Solver
  7. An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
  8. Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (Computational Logic)
  9. Translating Pseudo-Boolean Constraints into SAT (Journal on Satisfiability, Boolean Modeling and Computation)
  10. On the Complexity of Derivation in Propositional Calculus

Their papers