The following pages link to (Q4385532):
Displaying 50 items.
- Lazy context cloning for non-deterministic graph rewriting (Q2867896) (← links)
- A graphical representation of relational formulae with complementation (Q2889180) (← links)
- A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting (Q2942293) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- Growth of positive words and lower bounds of the growth rate for Thompson’s groups F(p) (Q2973337) (← links)
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (Q3000635) (← links)
- Up-To Techniques for Weighted Systems (Q3303913) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- Garside and Quadratic Normalisation: A Survey (Q3451086) (← links)
- Implementing term rewriting by jungle evaluation (Q3486867) (← links)
- A Probabilistic Applied Pi–Calculus (Q3498438) (← links)
- Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- Automated Induction with Constrained Tree Automata (Q3541728) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA (Q3646168) (← links)
- (Q4029341) (← links)
- (Q4222859) (← links)
- (Q4512408) (← links)
- Monadic simultaneous rigid E-unification and related problems (Q4571948) (← links)
- On modular properties of higher order extensional lambda calculi (Q4571956) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- The theory of vaccines (Q4571995) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- A partial solution for D-unification based on a reduction to AC 1-unification (Q4630297) (← links)
- Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
- Dynamically-typed computations for order-sorted equational presentations (Q4632447) (← links)
- Extension orderings (Q4645205) (← links)
- Approximation and normalization results for typeable term rewriting systems (Q4645802) (← links)
- Collapsing partial combinatory algebras (Q4645804) (← links)
- Development closed critical pairs (Q4645811) (← links)
- Termination of theorem proving by reuse (Q4647503) (← links)
- Unification and matching modulo nilpotence (Q4647522) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Theorem proving in cancellative abelian monoids (extended abstract) (Q4647536) (← links)
- Rewrite semantics for production rule systems: Theory and applications (Q4647544) (← links)
- Walther recursion (Q4647554) (← links)
- Grammar specification in categorial logics and theorem proving (Q4647559) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Some decidable congruences of free monoids (Q4783813) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- On confluence versus strong confluence for one-rule trace-rewriting systems (Q4841769) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
