Resolution of equations in algebraic structures. Volume II: Rewriting techniques
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4155899
- Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
- scientific article; zbMATH DE number 44213
- scientific article; zbMATH DE number 3866609
- scientific article; zbMATH DE number 50648
Cited in
(27)- An algebraic semantics approach to the effective resolution of type equations
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Algebraic and logic programming. Second international conference, Nancy, France, October 1--3, 1990. Proceedings
- An algebraic semantics for structured transition systems and its application to logic programs
- Well rewrite orderings and well quasi-orderings
- Completion of rewrite systems with membership constraints. II: Constraint solving
- On the modelling of search in theorem proving -- towards a theory of strategy analysis
- Deductive and inductive synthesis of equational programs
- Extending Bachmair's method for proof by consistency to the final algebra
- Induction = I-axiomatization + first-order consistency.
- Sound generalizations in mathematical induction
- Induction using term orders
- Pattern-matching spi-calculus
- Structures for abstract rewriting
- A categorical approach to unification of generalised terms
- scientific article; zbMATH DE number 4155899 (Why is no real title available?)
- scientific article; zbMATH DE number 4049024 (Why is no real title available?)
- scientific article; zbMATH DE number 44213 (Why is no real title available?)
- scientific article; zbMATH DE number 50648 (Why is no real title available?)
- Order-sorted generalization
- Termination tools in ordered completion
- A maximal-literal unit strategy for horn clauses
- Formalizing Bachmair and Ganzinger's ordered resolution prover
- A general framework to build contextual cover set induction provers
- Towards a foundation of completion procedures as semidecision procedures
- A completion procedure for conditional equations
- Tree algebras and varieties of tree languages
This page was built for publication: Resolution of equations in algebraic structures. Volume II: Rewriting techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3427354)
