Mark H. Liffiton
Computational Theory and Mathematics · 2007–2013
A researcher in the Science corpus: 2 papers; trusts 9 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 15 citations into it
- Artificial Intelligence — 14 citations into it
- Computer Networks and Communications — 7 citations into it
Whom Mark H. Liffiton trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Carsten Sinz
- Daniel Jackson
- Niklas Eén
- Bruno Dutertre
- Niklas Sörensson
- Leonardo de Moura
- Richard M. Karp
- Armin Biere
Who trusts Mark H. Liffiton overall
Papers from Mark H. Liffiton's perspective
Ordered by how strongly the researchers Mark H. Liffiton trusts endorse each paper. Same corpus, a different order for every researcher.
- Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
- Efficient CNF Encoding of Boolean Cardinality Constraints
- A machine program for theorem-proving (CACM)
- An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Alloy: a lightweight object modelling notation (TSEM)
- Translating Pseudo-Boolean Constraints into SAT (Journal on Satisfiability, Boolean Modeling and Computation)
- A Fast Linear-Arithmetic Solver for DPLL(T) (International Conference on Computer Aided Verification)
- Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications (2003 Design, Automation and Test in Europe Conference and Exhibition)
- PicoSAT Essentials (Journal on Satisfiability, Boolean Modeling and Computation)
Their papers
- Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints (2007) — 392 citations
- Iterative and core-guided MaxSAT solving: A survey and assessment (2013) — 193 citations