Lakhdar Sais
Computational Theory and Mathematics · 2004–2018
A researcher in the Science corpus: 3 papers; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 12 citations into it
- Artificial Intelligence — 10 citations into it
- Computer Networks and Communications — 8 citations into it
Whom Lakhdar Sais trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Lakhdar Sais's perspective
Ordered by how strongly the researchers Lakhdar Sais trusts endorse each paper. Same corpus, a different order for every researcher.
- A machine program for theorem-proving (CACM)
- A Structure-Preserving Clause Form Translation
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
- Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
- Backdoors to typical case complexity (International Joint Conference on Artificial Intelligence)
- Z3: An Efficient SMT Solver
- An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (Computational Logic)
- Translating Pseudo-Boolean Constraints into SAT (Journal on Satisfiability, Boolean Modeling and Computation)
Their papers
- Efficient SAT-Based Encodings of Conditional Cardinality Constraints (2018) — 8 citations
- ManySAT: a Parallel SAT Solver (2009) — 366 citations
- Boosting Systematic Search by Weighting Constraints (2004) — 536 citations