Optimizing the clausal normal form transformation

DOI10.1007/BF00249017zbMATH Open0733.68073MaRDI QIDQ809622FDOQ809622

Authors: Ralf Socher 

Publication date: 1991

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

Recommendations

• scientific article; zbMATH DE number 404251
• scientific article; zbMATH DE number 3876643
• A structure-preserving clause form translation
• Minimizing the number of clauses by renaming
• Computing small clause normal forms

zbMATH Keywords

clausal normal formprime implicants

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• The Problem of Simplifying Truth Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Cores and Prime Implicants of Truth Functions
• RST Flip-Flop Input Equations
• A New Algorithm for Generating Prime Implicants
• Theorem Proving via General Matings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Computing prime implicants via transversal clauses
• Algorithm for PP-reduction a PC formula to the clause form
• An algorithm for dual transformation in first-order logic
• Computing Tiny Clause Normal Forms
• A structure-preserving clause form translation
• Computing small clause normal forms
• Title not available (Why is that?)
• Prime forms and minimal change in propositional belief bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimality result for clause form translation
• Title not available (Why is that?)

This page was built for publication: Optimizing the clausal normal form transformation

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