A rewriting strategy to generate prime implicates in equational logic

DOI10.1007/978-3-319-08587-6_10zbMATH Open1423.68412OpenAlexW52563601MaRDI QIDQ3192186FDOQ3192186

Authors: Mnacho Echenim, Nicolas Peltier, Sophie Tourret 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_10

Recommendations

• Prime implicate generation in equational logic
• Quantifier-free equational logic and prime implicate generation
• An efficient algorithm to generate prime implicants
• Computing prime implicates by pruning the search space and accelerating subsumption
• scientific article; zbMATH DE number 1390353

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cited In (5)

• Computing prime implicants via transversal clauses
• A superposition calculus for abductive reasoning
• Prime implicate generation in equational logic
• A generic framework for implicate generation modulo theories
• Quantifier-free equational logic and prime implicate generation

This page was built for publication: A rewriting strategy to generate prime implicates in equational logic

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