Cesare Tinelli
Computational Theory and Mathematics · 2004–2022
A researcher in the Science corpus: 12 papers; trusts 26 researchers and is trusted by 41 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 65 citations into it; #1,401 of 12,182 by trust here, #1,936 by citations
- Artificial Intelligence — 58 citations into it; #5,186 of 35,345 by trust here, #8,619 by citations
- Software — 34 citations into it
- Computer Networks and Communications — 12 citations into it; #1,380 of 9,886 by trust here, #2,761 by citations
Whom Cesare Tinelli trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Clark W. Barrett
- Kenneth L. McMillan
- Robert Nieuwenhuis
- Bruno Dutertre
- Leonardo de Moura
- Lintao Zhang
- Geoff Sutcliffe
- Albert Oliveras
- J. Håstad
- Monique Laurent
Who trusts Cesare Tinelli overall
- Tim King
- Clark W. Barrett
- Guy Katz
- Martin Gebser
- Vaishak Belle
- Malik Ghallab
- Rajeev Alur
- Haniel Barbosa
- Sanjit A. Seshia
- Leonardo de Moura
Papers from Cesare Tinelli's perspective
Ordered by how strongly the researchers Cesare Tinelli trusts endorse each paper. Same corpus, a different order for every researcher.
- DPLL( T): Fast Decision Procedures (International Conference on Computer Aided Verification)
- CVC Lite: A New Implementation of the Cooperating Validity Checker Category B (International Conference on Computer Aided Verification)
- The complexity of theorem-proving procedures
- On the Complexity of Derivation in Propositional Calculus
- Interpolation and SAT-Based Model Checking (International Conference on Computer Aided Verification)
- BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
- A Fast Linear-Arithmetic Solver for DPLL(T) (International Conference on Computer Aided Verification)
- Reducibility Among Combinatorial Problems
- Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
- An interpolating theorem prover (Theoretical Computer Science)
Their papers
- Satisfiability Modulo Theories (2009) — 1,863 citations
- Splitting on Demand in SAT Modulo Theories (2006) — 125 citations
- DPLL( T): Fast Decision Procedures (2004) — 382 citations
- Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) (2006) — 992 citations
- Handbook of Satisfiability (2021) — 652 citations
- Leveraging linear and mixed integer programming for SMT (2014) — 22 citations
- Lazy proofs for DPLL(T)-based SMT solvers (2016) — 35 citations
- cvc5: A Versatile and Industrial-Strength SMT Solver (2022) — 537 citations
- Introducing StarExec: a Cross-Community Infrastructure for Logic Solving (2014) — 217 citations
- The SMT-LIB Standard Version 2.0 (2010) — 1,230 citations
- Satisfiability Modulo Theories (2006)
- The SMT-LIB Standard: Version 1.2 (2005) — 215 citations