Pages that link to "Item:Q1918503"
From MaRDI portal
The following pages link to Unification in the union of disjoint equational theories: Combining decision procedures (Q1918503):
Displaying 38 items.
- On the complexity of Boolean unification (Q293360) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Non-structural subtype entailment in automata theory (Q1887157) (← links)
- Combining decision algorithms for matching in the union of disjoint equational theories (Q1917102) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- Solving equations with sequence variables and sequence functions (Q2457427) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Canonization for disjoint unions of theories (Q2486580) (← links)
- Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Tractable and intractable instances of combination problems for unification and disunification (Q4952028) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- Combining Decision Procedures by (Model-)Equality Propagation (Q5179357) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
- Automated Deduction – CADE-19 (Q5900719) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
- Unification in a combination of equational theories: an efficient algorithm (Q6488538) (← links)
