scientific article; zbMATH DE number 1142316

Cited in

(only showing first 100 items - show all)

From a zoo to a zoology: Towards a general theory of graph polynomials
Termination of narrowing revisited
Combination of convex theories: modularity, deduction completeness, and explanation
Termination of rewriting
Higher-order rewrite systems and their confluence
Bubbles in modularity
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Equational unification, word unification, and 2nd-order equational unification
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Semantics of order-sorted specifications
Sequentiality in orthogonal term rewriting systems
Conditional rewriting logic as a unified model of concurrency
Narrowing based procedures for equational disunification
Modularity of simple termination of term rewriting systems with shared constructors
Simulation of Turing machines by a regular rewrite rule
Termination and completion modulo associativity, commutativity and identity
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
An improved general \(E\)-unification method
A field guide to equational logic
C-expressions: A variable-free calculus for equational logic programming
Well rewrite orderings and well quasi-orderings
A new method for undecidability proofs of first order theories
How to win a game with features
Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
Modular aspects of term graph rewriting
Semantics and strong sequentiality of priority term rewriting systems
Superposition theorem proving for abelian groups represented as integer modules
The first-order theory of linear one-step rewriting is undecidable
Orders, reduction graphs and spectra
Decidability and complexity analysis by basic paramodulation
On the modelling of search in theorem proving -- towards a theory of strategy analysis
Some results on cut-elimination, provable well-orderings, induction and reflection
Constructing inverse semigroups from category actions
Regular path queries with constraints
Combinatory reduction systems: Introduction and survey
Modularity of confluence: A simplified proof
Automated proofs of equality problems in Overbeek's competition
Competing for the \(AC\)-unification race
Deductive and inductive synthesis of equational programs
Proving termination of (conditional) rewrite systems. A semantic approach
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Decidability of reachability for disjoint union of term rewriting systems
Generalized sufficient conditions for modular termination of rewriting
Completeness results for basic narrowing
On subsumption in distributed derivations
A complete equational axiomatization for prefix iteration
Simple termination is difficult
On the modularity of termination of term rewriting systems
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Modular proofs for completeness of hierarchical term rewriting systems
Buchberger's algorithm: The term rewriter's point of view
Proving Ramsey's theory by the cover set induction: A case and comparision study.
Normalization results for typeable rewrite systems
Incremental constraint satisfaction for equational logic programming
Unification in sort theories and its applications
Lambda calculus with explicit recursion
Interaction nets and term-rewriting systems
Abstract data type systems
Proof systems for structured specifications with observability operators
Simple termination of rewrite systems
Developing developments
The first-order theory of lexicographic path orderings is undecidable
Unification of infinite sets of terms schematized by primal grammars
Practical algorithms for deciding path ordering constraint satisfaction.
A characterisation of multiply recursive functions with Higman's lemma.
A linear logical framework
On the transition graphs of Turing machines.
A rewriting approach to satisfiability procedures.
The unification problem for confluent right-ground term rewriting systems.
Analysing the implicit complexity of programs.
An upper bound on the derivational complexity of Knuth-Bendix orderings.
Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
Constraint contextual rewriting.
Theorem proving modulo
Superposition with completely built-in abelian groups
Loop checking in SLD-derivations by well-quasi-ordering of goals
Pattern-matching algorithms based on term rewrite systems
Some characteristics of strong innermost normalization
A property of left-linear rewrite systems preserving recognizability
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
Rational languages defined with a non-associative concatenation
MV-algebras, multiple bets and subjective states
Propositional compositions of partial predicates
Partial completion of equational theories
A unified language processing methodology
ELAN from a rewriting logic point of view
Maude: specification and programming in rewriting logic
Reflection in conditional rewriting logic
Abduction in logic programming: A new definition and an abductive procedure based on rewriting
Linguistic\(\leftrightarrow \)rational agents' semantics
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
Remarks on Thatte's transformation of term rewriting systems
Decision problems for semi-Thue systems with a few rules
Normalisation for higher-order calculi with explicit substitutions
Tree automata with one memory set constraints and cryptographic protocols
Abstract interpretation of mobile systems
Skew confluence and the lambda calculus with letrec
Algorithms and reductions for rewriting problems. II.
Unions of non-disjoint theories and combinations of satisfiability procedures

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)