scientific article; zbMATH DE number 1142316

Cited in

(only showing first 100 items - show all)

Conditional rewriting logic: Deduction, models and concurrency
Associative-commutative deduction with constraints
Unique normal forms for nonlinear term rewriting systems: Root overlaps
HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
A simple language supporting angelic nondeterminism and parallel composition
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
C-expressions: A variable-free calculus for equational logic programming
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
Collapsed tree rewriting: Completeness, confluence, and modularity
More efficient left-to-right matching for overlapping pattern
Critical pairs in term graph rewriting
Propositional compositions of partial predicates
A graphical representation of relational formulae with complementation
Generalized rewrite theories, coherence completion, and symbolic methods
What is essential unification?
The theory of vaccines
Normalization by leftmost innermost rewriting
Modularity of simple termination of term rewriting systems with shared constructors
Towards an Efficient Implementation of Tree Automata Completion
Bisimilarity in term graph rewriting.
Deductive and inductive synthesis of equational programs
Strict coherence of conditional rewriting modulo axioms
Complete axiomatizations of some quotient term algebras
On the complexity of recursive path orderings
Using geometric rewrite rules for solving geometric problems symbolically
Some decidable congruences of free monoids
Total termination of term rewriting
Confluence by critical pair analysis revisited
Modularity of confluence: A simplified proof
Set of support, demodulation, paramodulation: a historical perspective
Generalized sufficient conditions for modular termination of rewriting
Simple termination of rewrite systems
Higher order conditional rewriting and narrowing
Collapsing partial combinatory algebras
On the modularity of termination of term rewriting systems
Rewriting regular inequalities
Completion of rewrite systems with membership constraints
Incremental constraint satisfaction for equational logic programming
Cancellative Abelian monoids and related structures in refutational theorem proving. I
Optimal normalization in orthogonal term rewriting systems
Total termination of term rewriting
Decidable first-order transition logics for PA-processes
ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
Higher-order unification, polymorphism, and subsorts
Equation solving in conditional AC-theories
A unified language processing methodology
Congruence types
A new proposal of concurrent process calculus
Theorem proving modulo associativity
Inductive-data-type systems
A new method for undecidability proofs of first order theories
Growing trees and amoebas' replications
A characterisation of multiply recursive functions with Higman's lemma.
Practical algorithms for deciding path ordering constraint satisfaction.
On notions of inductive validity for first-order equational clauses
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
On the rational subsets of the free group
Well-founded coalgebras, revisited
Reflection in conditional rewriting logic
Partial derivatives of regular expressions and finite automaton constructions
Programming with narrowing: a tutorial
Higher-order families
A partial evaluation framework for order-sorted equational programs modulo axioms
Ground confluence of order-sorted conditional specifications modulo axioms
Higher-order proof by consistency
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Rational rewriting
Efficient theory combination via Boolean search
A property of left-linear rewrite systems preserving recognizability
Open problems in rewriting
E-generalization using grammars
Canonical ground Horn theories
Normal forms for connectedness in categories
A structural theory of rhythm notation based on tree representations and term rewriting
Normal higher-order termination
scientific article; zbMATH DE number 7450013 (Why is no real title available?)
Metalevel algorithms for variant satisfiability
Rewriting logic as a semantic framework for concurrency: a progress report
Any ground associative-commutative theory has a finite canonical system
Implementing contextual rewriting
Constraint contextual rewriting.
Some undecidable termination problems for semi-Thue systems
An introduction to category-based equational logic
Multiset rewriting over Fibonacci and tribonacci numbers
Fundamentals of context-sensitive rewriting
Proof theory of higher-order equations: Conservativity, normal forms and term rewriting.
Modular proofs for completeness of hierarchical term rewriting systems
Explicit substitutions with de bruijn's levels
Compositional synthesis of maximally permissive supervisors using supervision equivalence

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)