Problems in rewriting III
From MaRDI portal
Publication:5055847
Recommendations
Cites work
- scientific article; zbMATH DE number 2185670 (Why is no real title available?)
- scientific article; zbMATH DE number 3860380 (Why is no real title available?)
- scientific article; zbMATH DE number 4210102 (Why is no real title available?)
- scientific article; zbMATH DE number 4049135 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 41806 (Why is no real title available?)
- scientific article; zbMATH DE number 176755 (Why is no real title available?)
- scientific article; zbMATH DE number 4124996 (Why is no real title available?)
- scientific article; zbMATH DE number 1324441 (Why is no real title available?)
- scientific article; zbMATH DE number 1348460 (Why is no real title available?)
- scientific article; zbMATH DE number 1348479 (Why is no real title available?)
- scientific article; zbMATH DE number 512772 (Why is no real title available?)
- scientific article; zbMATH DE number 512795 (Why is no real title available?)
- scientific article; zbMATH DE number 512856 (Why is no real title available?)
- scientific article; zbMATH DE number 512857 (Why is no real title available?)
- scientific article; zbMATH DE number 517065 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1499112 (Why is no real title available?)
- scientific article; zbMATH DE number 194511 (Why is no real title available?)
- scientific article; zbMATH DE number 1380885 (Why is no real title available?)
- scientific article; zbMATH DE number 1398069 (Why is no real title available?)
- scientific article; zbMATH DE number 1414284 (Why is no real title available?)
- scientific article; zbMATH DE number 1456966 (Why is no real title available?)
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- A logic programming language with lambda-abstraction, function variables, and simple unification
- A new method for undecidability proofs of first order theories
- A partial solution for \(D\)-unification based on a reduction to AC1-unification
- A rationale for conditional equational programming
- A superposition oriented theorem prover
- AC complement problems: Satisfiability and negation elimination
- About the theory of tree embedding
- Accessible Independence Results for Peano Arithmetic
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- An efficient representation of arithmetic for term rewriting
- Automatic proofs by induction in theories without constructors
- Bounding derivation lengths with functions from the slow growing hierarchy
- COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
- Clausal rewriting
- Combination techniques and decision problems for disunification
- Complete axiomatizations of some quotient term algebras
- Conditional rewriting in focus
- Confluence by decreasing diagrams
- Confluence of the lambda calculus with left-linear algebraic rewriting
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Decidability of systems of set constraints with negative constraints
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Encompassment properties and automata with constraints
- Explicit substitutions with de bruijn's levels
- Introduction to generalized type systems
- LFCS '94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings
- Modular AC unification of higher-order patterns
- Modular aspects of properties of term rewriting systems related to normal forms
- Modularity of strong normalization in the algebraic-λ-cube
- Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
- More problems in rewriting
- On sufficient-completeness and related properties of term rewriting systems
- On termination of one rule rewrite systems
- Open problems in rewriting
- Reduction techniques for first-order reasoning
- Rewrite systems for integer arithmetic
- Rewrite systems for varieties of semigroups
- Set constraints with projections
- Simple termination is difficult
- Simulation of Turing machines by a regular rewrite rule
- Termination of term rewriting: Interpretation and type elimination
- The Church-Rosser property for ground term-rewriting systems is decidable
- The first-order theory of lexicographic path orderings is undecidable
- Total termination of term rewriting
- Total termination of term rewriting is undecidable
- Unification problems with one-sided distributivity
- “Syntactic” AC-unification
Cited in
(6)- More problems in rewriting
- Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
- scientific article; zbMATH DE number 5560346 (Why is no real title available?)
- The first-order theory of one-step rewriting is undecidable
- Thue trees
- The first-order theory of linear one-step rewriting is undecidable
This page was built for publication: Problems in rewriting III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055847)
