The following pages link to (Q5581665):
Displayed 50 items.
- Effective codescent morphisms in the varieties determined by convergent term rewriting systems. (Q278228) (← links)
- Adding decision procedures to SMT solvers using axioms with triggers (Q287384) (← links)
- Multi-completion with termination tools (Q352956) (← links)
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent (Q407556) (← links)
- Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs (Q418014) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Conjecture synthesis for inductive theories (Q438543) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- Finite derivation type for semilattices of semigroups. (Q444671) (← links)
- On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Building exact computation sequences (Q579925) (← links)
- Verifying nilpotence (Q580975) (← links)
- Order-sorted unification (Q582269) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- Orderings for term-rewriting systems (Q593789) (← links)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem (Q616850) (← links)
- Categorification, term rewriting and the Knuth-Bendix procedure (Q626714) (← links)
- Best unifiers in transitive modal logics (Q647403) (← links)
- Efficiency issues in the KBMAG procedure (Q649584) (← links)
- Confluence for graph transformations (Q672753) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Natural termination (Q673622) (← links)
- Relational graph rewritings (Q673789) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- The problem of demodulator adjunction (Q688566) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On word problems in Horn theories (Q757095) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- On the relation between resolution based and completion based theorem proving (Q758218) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- Proofs by induction in equational theories with constructors (Q789177) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Remarks on an example of Jantzen (Q793015) (← links)
- On graph rewritings (Q800736) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- On the data type extension problem for algebraic specifications (Q801668) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Modular tree transducers (Q807012) (← links)
- Semi-unification (Q808713) (← links)