Pages that link to "Item:Q1186723"
From MaRDI portal
The following pages link to Combining matching algorithms: The regular case (Q1186723):
Displaying 14 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Combining word problems through rewriting in categories with products (Q1398463) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Combining decision algorithms for matching in the union of disjoint equational theories (Q1917102) (← links)
- Building and combining matching algorithms (Q2185488) (← links)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
- Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- Combining matching algorithms: The regular case (Q5055731) (← links)
- Automated Deduction – CADE-19 (Q5900720) (← links)