scientific article; zbMATH DE number 3990847
From MaRDI portal
Publication:3753472
Recommendations
Cited in
(18)- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- Using induction and rewriting to verify and complete parameterized specifications
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
- Improving rewriting induction approach for proving ground confluence
- Proofs in parameterized specifications
- Conditional narrowing modulo a set of equations
- A proof system for conditional algebraic specifications
- Priority rewriting: Semantics, confluence, and conditionals
- Ground confluence of order-sorted conditional specifications modulo axioms
- On word problems in Horn theories
- Harald Ganzinger's legacy: contributions to logics and programming
- Proving ground confluence of equational specifications modulo axioms
- Completion of first-order clauses with equality by strict superposition
- Simultaneous checking of completeness and ground confluence for algebraic specifications
- From search to computation: redundancy criteria and simplification at work
- On theorem-proving in Horn theories with built-in algebras
- Sufficient completeness verification for conditional and constrained TRS
- A completion procedure for conditional equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753472)
