Negation elimination in equational formulae (extended abstract)

DOI10.1007/3-540-55808-X_17MaRDI QIDQ5096830zbMATH OpenFDO

Authors Hubert Comon, Maribel Fernández

Publication date 18 August 2022

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

Full work available at URL https://doi.org/10.1007/3-540-55808-X_17

Mathematics Subject Classification ID

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

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

Cites work

• Equational problems and disunification
• Explicit representation of terms defined by counter examples
• scientific article; zbMATH DE number 176121 (Why is no real title available?)
• scientific article; zbMATH DE number 176756 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)

Cited in

(9)

• Equational problems and disunification
• Negation elimination in empty or permutative theories
• Nominal equational problems
• scientific article; zbMATH DE number 1670857 (Why is no real title available?)
• scientific article; zbMATH DE number 176121 (Why is no real title available?)
• The negation elimination from syntactic equational formula is decidable
• AC complement problems: Satisfiability and negation elimination
• A nominal approach to equational problems in languages with binders
• Symbol elimination and applications to parametric entailment problems

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)