scientific article; zbMATH DE number 1142316
From MaRDI portal
Publication:4385532
zbMATH Open0900.68283MaRDI QIDQ4385532FDOQ4385532
Authors: Nachum Dershowitz, Jean-Pierre Jouannaud 
Publication date: 14 May 1998
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Critical pairs in term graph rewriting
- The theory of vaccines
- Collapsing partial combinatory algebras
- Optimal normalization in orthogonal term rewriting systems
- Open problems in rewriting
- Title not available (Why is that?)
- Implementing contextual rewriting
- How to win a game with features
- The first-order theory of lexicographic path orderings is undecidable
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- On modular properties of higher order extensional lambda calculi
- Modular aspects of term graph rewriting
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
- Orders, reduction graphs and spectra
- Proving equational and inductive theorems by completion and embedding techniques
- The first-order theory of linear one-step rewriting is undecidable
- Generating polynomial orderings for termination proofs
- Buchberger's algorithm: The term rewriter's point of view
- A categorical formulation for critical-pair/completion procedures
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Bubbles in modularity
- Equational unification, word unification, and 2nd-order equational unification
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- How to win a game with features
- Decidability of reachability for disjoint union of term rewriting systems
- More problems in rewriting
- On the longest perpetual reductions in orthogonal expression reduction systems
- Semantics and strong sequentially of priority term rewriting systems
- Reduction techniques for first-order reasoning
- Semantics and strong sequentiality of priority term rewriting systems
- Automated proofs of equality problems in Overbeek's competition
- Decidability of bounded higher-order unification
- On explicit substitution with names
- On subsumption in distributed derivations
- From diagrammatic confluence to modularity
- Combination of convex theories: modularity, deduction completeness, and explanation
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Proving Ramsey's theory by the cover set induction: A case and comparision study.
- Competing for the \(AC\)-unification race
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent
- Path orderings for termination of associative-commutative rewriting
- Linguistic\(\leftrightarrow \)rational agents' semantics
- On interreduction of semi-complete term rewriting systems
- Some independence results for equational unification
- On confluence of one-rule trace-rewriting systems
- Associative-commutative deduction with constraints
- On fairness of completion-based theorem proving strategies
- A recursive path ordering for higher-order terms in η-long β-normal form
- Modularity of termination in term graph rewriting
- On narrowing, refutation proofs and constraints
- Problems in rewriting III
- The first-order theory of one-step rewriting is undecidable
- Algorithms and reductions for rewriting problems. II.
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
- Logic with equality: Partisan corroboration and shifted pairing
- On terminating lemma speculations.
- Using tableaux to automate the Lambek and other categorial calculi
- The undecidability of the first-order theories of one step rewriting in linear canonical systems
- A hidden Herbrand theorem: Combining the object and logic paradigms
- Propositional compositions of partial predicates
- Bisimilarity in term graph rewriting.
- Total termination of term rewriting
- Total termination of term rewriting
- Simple termination of rewrite systems
- A unified language processing methodology
- A characterisation of multiply recursive functions with Higman's lemma.
- Practical algorithms for deciding path ordering constraint satisfaction.
- Canonical ground Horn theories
- A property of left-linear rewrite systems preserving recognizability
- Constraint contextual rewriting.
- Category-based modularisation for equational logic programming
- Size-based termination of higher-order rewriting
- Termination by absence of infinite chains of dependency pairs
- Remarks on Thatte's transformation of term rewriting systems
- Normalisation for higher-order calculi with explicit substitutions
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
- Concurrent garbage collection for concurrent rewriting
- (Head-)normalization of typeable rewrite systems
- Dynamically-typed computations for order-sorted equational presentations
- On proving termination by innermost termination
- Combinations of simplifying conditional term rewriting systems
- Termination of term rewriting by interpretation
- Strictly orthogonal left linear rewrite systems and primitive recursion
- Relating two categorical models of term rewriting
- About the theory of tree embedding
- Dummy elimination in equational rewriting
- Dummy elimination: Making termination easier
- Interaction nets and term-rewriting systems
- CPO models for infinite term rewriting
- Time bounded rewrite systems and termination proofs by generalized embedding
- Associative-commutative discrimination nets
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Verifying Cryptographic Protocols with Subterms Constraints
- A modular construction of type theories
- Term rewriting in \(\mathrm{CT}_\Sigma \)
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Pattern-matching algorithms based on term rewrite systems
- Rational languages defined with a non-associative concatenation
- Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
- LARS: a learning algorithm for rewriting systems
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 Q4385532)
