The following pages link to (Q3785940):
Displaying 29 items.
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- Intractable unifiability problems and backtracking (Q1262770) (← links)
- The STO problem is NP-complete (Q1284283) (← links)
- A term equality problem equivalent to graph isomorphism (Q1332775) (← links)
- Computing answers with model elimination (Q1402748) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- The STO-problem is NP-hard (Q1892125) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Probabilistic inductive constraint logic (Q2051275) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- Efficient instance retrieval with standard and relational path indexing (Q2486586) (← links)
- A rewrite framework for language definitions and for generation of efficient interpreters (Q2873785) (← links)
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
- Unification and matching modulo nilpotence (Q4647522) (← links)
- (Q4708591) (← links)
- Simple and Efficient Clause Subsumption with Feature Vector Indexing (Q4913860) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)
- Rewriting Techniques and Applications (Q5901562) (← links)
- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete (Q6488535) (← links)
