The following pages link to Cesare Tinelli (Q429585):
Displaying 28 items.
- Combining Non-Stably Infinite Theories (Q4916220) (← links)
- Quantifier Instantiation Techniques for Finite Model Finding in SMT (Q4928453) (← links)
- Foundations of Satisfiability Modulo Theories (Q4931590) (← links)
- (Q4938605) (← links)
- Ground Interpolation for Combined Theories (Q5191102) (← links)
- Model Evolution with Equality Modulo Built-in Theories (Q5200017) (← links)
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method (Q5234683) (← links)
- Automated Reasoning (Q5307057) (← links)
- (Q5309032) (← links)
- Computer Aided Verification (Q5312898) (← links)
- Splitting on Demand in SAT Modulo Theories (Q5387916) (← links)
- Lemma Learning in the Model Evolution Calculus (Q5387921) (← links)
- Logics in Artificial Intelligence (Q5394160) (← links)
- Automated Deduction – CADE-20 (Q5394627) (← links)
- An Abstract Framework for Satisfiability Modulo Theories (Q5434475) (← links)
- (LIA) - Model Evolution with Linear Integer Arithmetic Constraints (Q5505559) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705940) (← links)
- Combined Satisfiability Modulo Parametric Theories (Q5758134) (← links)
- Automated Deduction – CADE-19 (Q5900727) (← links)
- Reasoning about vectors: satisfiability modulo a theory of sequences (Q6053845) (← links)
- Combining stable infiniteness and (strong) politeness (Q6053847) (← links)
- Synthesising programs with non-trivial constants (Q6161231) (← links)
- Even Faster Conflicts and Lazier Reductions for String Solvers (Q6487337) (← links)
- Satisfiability modulo finite fields (Q6535532) (← links)
- SMT-LIB release 2023 (incremental benchmarks) (Q6710206) (← links)
- SMT-LIB release 2023 (non-incremental benchmarks) (Q6710211) (← links)
- SMT-LIB release 2024 (non-incremental benchmarks) (Q6710242) (← links)
- SMT-LIB release 2024 (incremental benchmarks) (Q6710243) (← links)
