The following pages link to Stéphane Graham-Lengrand (Q832718):
Displaying 8 items.
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Solving bitvectors with MCSAT: explanations from bits and pieces (Q2096440) (← links)
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic (Q2180511) (← links)
- Conflict-driven satisfiability for theory combination: transition system and completeness (Q2303254) (← links)
- Satisfiability modulo theories and assignments (Q2405239) (← links)
- Psyche: A Proof-Search Engine Based on Sequent Calculus with an LCF-Style Architecture (Q2851941) (← links)
- Axiomatic Constraint Systems for Proof Search Modulo Theories (Q2964465) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
