Roberto Sebastiani

Computational Theory and Mathematics · 2002–2021

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

Subfields

• Computational Theory and Mathematics — 40 citations into it; #5,392 of 12,182 by trust here, #3,339 by citations
• Artificial Intelligence — 32 citations into it; #9,568 of 35,345 by trust here, #12,974 by citations
• Software — 20 citations into it; #740 of 1,227 by trust here, #674 by citations
• Computer Networks and Communications — 10 citations into it; #7,146 of 9,886 by trust here, #7,832 by citations

Whom Roberto Sebastiani trusts overall

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

1. Kenneth L. McMillan
2. Lintao Zhang
3. Robert Nieuwenhuis
4. J. Håstad
5. Monique Laurent
6. Niklas Eén
7. Clark W. Barrett
8. Bruno Dutertre
9. Leonardo de Moura
10. Michel X. Goemans

Who trusts Roberto Sebastiani overall

1. Vaishak Belle
2. Guy Van den Broeck
3. Antti Hyttinen
4. Souradeep Dutta
5. Andrea Passerini
6. Cristian Cadar
7. Aws Albarghouthi
8. Goutham Ramakrishnan
9. Susmit Jha
10. Tim King

Papers from Roberto Sebastiani's perspective

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

1. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
2. The complexity of theorem-proving procedures
3. DPLL( T): Fast Decision Procedures (International Conference on Computer Aided Verification)
4. CVC Lite: A New Implementation of the Cooperating Validity Checker Category B (International Conference on Computer Aided Verification)
5. Interpolation and SAT-Based Model Checking (International Conference on Computer Aided Verification)
6. BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
7. On the Complexity of Derivation in Propositional Calculus
8. An interpolating theorem prover (Theoretical Computer Science)
9. Reducibility Among Combinatorial Problems
10. Semidefinite programming relaxations for semialgebraic problems

Their papers

• Satisfiability Modulo Theories (2009) — 1,863 citations
• Handbook of Satisfiability (2021) — 652 citations
• The MathSAT5 SMT Solver (2013) — 563 citations
• NuSMV 2: An OpenSource Tool for Symbolic Model Checking (2002) — 1,709 citations
• Reasoning with Goal Models (2002) — 337 citations
• Nusmv version 2: an opensource tool for symbolic model checking (2002) — 460 citations