The following pages link to Pascal Fontaine (Q436375):
Displaying 32 items.
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- Quantifier simplification by unification in SMT (Q831945) (← links)
- Subtropical satisfiability (Q1687555) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- Theory combination: beyond equality sharing (Q2185458) (← links)
- Politeness and combination methods for theories with bridging functions (Q2303236) (← links)
- Revisiting enumerative instantiation (Q2324227) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- (Q2848056) (← links)
- Combination of Disjoint Theories: Beyond Decidability (Q2908497) (← links)
- Adapting Real Quantifier Elimination Methods for Conflict Set Computation (Q2964460) (← links)
- A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- A Gentle Non-disjoint Combination of Satisfiability Procedures (Q3192185) (← links)
- Congruence Closure with Free Variables (Q3303931) (← links)
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (Q3454111) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- (Q4417916) (← links)
- (Q4428300) (← links)
- Combining Decision Procedures by (Model-)Equality Propagation (Q5179357) (← links)
- Exploiting Symmetry in SMT Problems (Q5200027) (← links)
- Compression of Propositional Resolution Proofs via Partial Regularization (Q5200028) (← links)
- (Q5219923) (← links)
- Modal Satisfiability via SMT Solving (Q5256336) (← links)
- Satisfiability checking and symbolic computation (Q5268815) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705949) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5899057) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- Scalable fine-grained proofs for formula processing (Q5920090) (← links)
- Non-emptiness test for automata over words indexed by the reals and rationals (Q6666789) (← links)
