Negation elimination in equational formulae (extended abstract)

DOI10.1007/3-540-55808-X_17zbMATH Open1496.03040MaRDI QIDQ5096830FDOQ5096830

Hubert Comon, Maribel Fernández

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Recommendations

• Negation elimination in empty or permutative theories
• On solving equations and disequations
• scientific article; zbMATH DE number 1670857
• The negation elimination from syntactic equational formula is decidable
• Equational problems and disunification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• Equational problems and disunification
• Explicit representation of terms defined by counter examples
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Symbol elimination and applications to parametric entailment problems
• Nominal equational problems
• Title not available (Why is that?)
• Equational problems and disunification
• The negation elimination from syntactic equational formula is decidable
• AC complement problems: Satisfiability and negation elimination
• Title not available (Why is that?)

This page was built for publication: Negation elimination in equational formulae (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096830)