Reconstruction of Boolean formulas in conjunctive normal form

DOI10.1007/978-3-319-94776-1_49MaRDI QIDQ1791022zbMATH OpenOpenAlexFDO

Authors E. Ya. Dantsin, Alexander Wolpert

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_49

Mathematics Subject Classification ID

Classical propositional logic (03B05) Hypergraphs (05C65)

Recommendations

• On the reconstruction of graph invariants
• Graph reconstruction -- some new developments
• Progress on the reconstruction conjecture
• Graph reconstruction from subgraphs
• Some results and approaches for reconstruction conjectures

Cited in

(2)

• Decomposing Quantified Conjunctive (or Disjunctive) Formulas
• Using binary patterns for counting falsifying assignments of conjunctive forms

This page was built for publication: Reconstruction of Boolean formulas in conjunctive normal form

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