Deciding the word problem for ground identities with commutative and extensional symbols
From MaRDI portal
Publication:2096444
Recommendations
Cites work
- scientific article; zbMATH DE number 51770 (Why is no real title available?)
- scientific article; zbMATH DE number 1538018 (Why is no real title available?)
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- An algorithm for reasoning about equality
- An introduction to description logic
- Any ground associative-commutative theory has a finite canonical system
- Conditional congruence closure over uninterpreted and interpreted symbols
- Fast Decision Procedures Based on Congruence Closure
- Fast congruence closure and extensions
- Modal tableau systems with blocking and congruence closure
- Shostak's congruence closure as completion
- Term Rewriting and All That
- The theorem prover of the program verifier Tatzelwurm
- Variations on the Common Subexpression Problem
Cited in
(2)
This page was built for publication: Deciding the word problem for ground identities with commutative and extensional symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096444)