scientific article; zbMATH DE number 3938563
From MaRDI portal
Publication:3709891
Recommendations
- scientific article; zbMATH DE number 3921985
- Conditional and typed rewriting systems. 2nd international CTRS workshop, Montreal, Canada, June 11--14, 1990. Proceedings
- scientific article; zbMATH DE number 4092758
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- scientific article; zbMATH DE number 3930372
Cited in
(27)- On solving the equality problem in theories defined by Horn clauses
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- History and basic features of the critical-pair/completion procedure
- Automatic inductive theorem proving using Prolog
- Narrowing vs. SLD-resolution
- Conditional rewrite rules: Confluence and termination
- Order-sorted completion: The many-sorted way
- Efficient deduction in equality Horn logic by Horn-completion
- Conditional and typed rewriting systems. 2nd international CTRS workshop, Montreal, Canada, June 11--14, 1990. Proceedings
- Conditional narrowing modulo a set of equations
- Complete sets of transformations for general E-unification
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
- Incremental constraint satisfaction for equational logic programming
- A strong restriction of the inductive completion procedure
- Basic narrowing revisited
- Kernel-LEAF: A logic plus functional language
- scientific article; zbMATH DE number 2185721 (Why is no real title available?)
- scientific article; zbMATH DE number 3921985 (Why is no real title available?)
- scientific article; zbMATH DE number 3930372 (Why is no real title available?)
- scientific article; zbMATH DE number 4041318 (Why is no real title available?)
- scientific article; zbMATH DE number 4047068 (Why is no real title available?)
- Termination of Fair Computations in Term Rewriting
- Confluence of terminating membership conditional TRS
- Dynamic detection of determinism in functional logic languages
- A completion procedure for conditional equations
- Conditional equational theories and complete sets of transformations
- Termination of just/fair computations in term rewriting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709891)