The following pages link to Alexander Serebrenik (Q199250):
Displaying 31 items.
- (Q427709) (redirect page) (← links)
- Code generation with templates (Q427711) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Can I find a partner? Undecidability of partner existence for open nets (Q975497) (← links)
- (Q2851074) (← links)
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- On Termination of Meta-programs (Q2996191) (← links)
- Inference of Termination Conditions for Numerical Loops in Prolog (Q2996199) (← links)
- On termination of meta-programs (Q3370573) (← links)
- Process Discovery Using Integer Linear Programming (Q3510879) (← links)
- Automated termination analysis for logic programs with cut (Q3585154) (← links)
- Automated Termination Analysis for Logic Programs by Term Rewriting (Q3591084) (← links)
- (Q3601867) (← links)
- History-Dependent Petri Nets (Q3612932) (← links)
- Nested Nets for Adaptive Systems (Q3618708) (← links)
- Process Discovery using Integer Linear Programming (Q3647366) (← links)
- (Q4411956) (← links)
- (Q4421872) (← links)
- (Q4499242) (← links)
- Inference of termination conditions for numerical loops in Prolog (Q4669655) (← links)
- (Q4707739) (← links)
- Logic Programming (Q5313210) (← links)
- (Q5422282) (← links)
- Recurrence with affine level mappings is P-time decidable for CLP (Q5437651) (← links)
- Improving Prolog programs: Refactoring for Prolog (Q5451972) (← links)
- On Termination of Binary CLP Programs (Q5458805) (← links)
- (Q5506369) (← links)
- Program Development in Computational Logic (Q5712541) (← links)
- Applications and Theory of Petri Nets 2005 (Q5713505) (← links)
- Logic Based Program Synthesis and Transformation (Q5713935) (← links)
- A general framework for automatic termination analysis od logic programs (Q5941755) (← links)
