Computationally Equivalent Elimination of Conditions
From MaRDI portal
Recommendations
- Elimination of conditions
- Computer solution of the fundamental elimination problem
- Sufficient conditions for cut elimination with complexity analysis
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- scientific article; zbMATH DE number 1303344
- scientific article; zbMATH DE number 4092755
- Computing answers with model elimination
- Effective difference elimination and nullstellensatz
Cited in
(16)- Elimination of conditions
- Applications and extensions of context-sensitive rewriting
- Using well-founded relations for proving operational termination
- Computing more specific versions of conditional rewriting systems
- Transformation for refining unraveled conditional term rewriting systems
- Complexity of conditional term rewriting
- Transformations of Conditional Rewrite Systems Revisited
- Dependency pairs for proving termination properties of conditional term rewriting systems
- scientific article; zbMATH DE number 4092755 (Why is no real title available?)
- Completion after program inversion of injective functions
- Notes on structure-preserving transformations of conditional term rewrite systems
- On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
- Conditional complexity
- Recent Trends in Algebraic Development Techniques
- Symbolic Specialization of Rewriting Logic Theories with Presto
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
This page was built for publication: Computationally Equivalent Elimination of Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527281)
