The negation elimination from syntactic equational formula is decidable
From MaRDI portal
(Redirected from Publication:5055804)
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- An almost linear Robinson unification algorithm
- An Efficient Unification Algorithm
- Automatic proofs by induction in theories without constructors
- Explicit representation of terms defined by counter examples
- scientific article; zbMATH DE number 3649012 (Why is no real title available?)
- scientific article; zbMATH DE number 176121 (Why is no real title available?)
- Linear unification
- The algebraic specification of abstract data types
Cited in
(8)- Negation elimination in empty or permutative theories
- Explicit versus implicit representations of subsets of the Herbrand universe.
- Equational formulas and pattern operations in initial order-sorted algebras
- scientific article; zbMATH DE number 1670857 (Why is no real title available?)
- scientific article; zbMATH DE number 176121 (Why is no real title available?)
- More problems in rewriting
- Negation elimination in equational formulae (extended abstract)
- Difference of constrained patterns in logically constrained term rewrite systems
This page was built for publication: The negation elimination from syntactic equational formula is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055804)