The following pages link to E-Darvin (Q18923):
Displayed 20 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Computing finite models by reduction to function-free clause logic (Q1006733) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- SCL(EQ): SCL for first-order logic with equality (Q2104511) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- Finite reasons for safety (Q2351397) (← links)
- Model Finding for Recursive Functions in SMT (Q2817915) (← links)
- The TPTP Typed First-Order Form with Arithmetic (Q2891471) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Theorem proving for classical logic with partial functions by reduction to Kleene logic (Q2987064) (← links)
- (Q3011302) (← links)
- Exploring Theories with a Model-Finding Assistant (Q3454114) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- MACE4 and SEM: A Comparison of Finite Model Generators (Q4913862) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- Exploiting Symmetry in SMT Problems (Q5200027) (← links)
- Lemma Learning in the Model Evolution Calculus (Q5387921) (← links)