scientific article

zbMath0667.68043MaRDI QIDQ3819993

Nachum Dershowitz, G. Sivakumar, Mitsuhiro Okada

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

satisfactionconfluencerewritingNoetherian propertyconditional rewrite systemspredicate calculus with equalityjoin systemsKnuth-Bendix critical pairsreducibility relation

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Combinations of simplifying conditional term rewriting systems, Sufficient conditions for modular termination of conditional term rewriting systems, Extended term rewriting systems, Proof by consistency in conditional equational theories, Confluence of the disjoint union of conditional term rewriting systems, Completeness results for basic narrowing, Implicit induction in conditional theories, Structures for abstract rewriting, An improved general path order, Equation solving in conditional AC-theories, A rationale for conditional equational programming, Probabilistic logic over equations and domain restrictions, Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems, Logicality of conditional rewrite systems, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Reachability in Conditional Term Rewriting Systems, Conditional linearization, Reachability analysis over term rewriting systems, Shallow confluence of conditional term rewriting systems, Applications and extensions of context-sensitive rewriting, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Perpetuality and uniform normalization in orthogonal rewrite systems, Proving termination of (conditional) rewrite systems. A semantic approach