Entity usage

Showing below up to 39 results in range #1 to #39.

1. Set-of-support strategy for higher-order logic: Label: en
2. An optimal narrowing strategy for general canonical systems: Label: en
3. A new approach to general E-unification based on conditional rewriting systems: Label: en
4. A strategy to deal with divergent rewrite systems: Label: en
5. Normalization by leftmost innermost rewriting: Label: en
6. Logic programs with polymorphic types: A condition for static type checking: Label: en
7. Termination proofs of well-moded logic programs via conditional rewrite systems: Label: en
8. Generalized partial computation using disunification to solve constraints: Label: en
9. Completion for constrained term rewriting systems: Label: en
10. Completeness and confluence of order-sorted term rewriting: Label: en
11. Confluence of terminating membership conditional TRS: Label: en
12. Implementing contextual rewriting: Label: en
13. A calculus for conditional inductive theorem proving: Label: en
14. Trace rewriting systems: Label: en
15. A categorical formulation for critical-pair/completion procedures: Label: en
16. Could orders be captured by term rewriting systems?: Label: en
17. Semigroups satisfying x m+n = x n: Label: en
18. Proving group isomorphism theorems: Label: en
19. Computing linearizations using test sets: Label: en
20. Decidability of regularity and related properties of ground normal form languages: Label: en
21. Conditional term rewriting and first-order theorem proving: Label: en
22. Reduction techniques for first-order reasoning: Label: en
23. Inductive theorem proving by consistency for first-order clauses: Label: en
24. Semantics for positive/negative conditional rewrite systems: Label: en
25. A constructor-based approach for positive/negative-conditional equational specifications: Label: en
26. Generic induction proofs: Label: en
27. Path orderings for termination of associative-commutative rewriting: Label: en
28. Termination of term rewriting by interpretation: Label: en
29. Type removal in term rewriting: Label: en
30. Termination of combined (rewrite and λ-calculus) systems: Label: en
31. Sufficient conditions for modular termination of conditional term rewriting systems: Label: en
32. Combinations of simplifying conditional term rewriting systems: Label: en
33. Collapsed tree rewriting: Completeness, confluence, and modularity: Label: en
34. Completeness of combinations of conditional constructor systems: Label: en
35. Consistency and semantics of equational definitions over predefined algebras: Label: en
36. Simple type inference for term graph rewriting systems: Label: en
37. Explicit cyclic substitutions: Label: en
38. Context rewriting: Label: en
39. Algebraic semantics of rewriting terms and types: Label: en