Simplifying Binary Propositional Theories into Connected Components Twice as Fast

DOI10.1007/3-540-45653-8_27zbMath1275.68130OpenAlexW1600913231MaRDI QIDQ2996178

Alvaro del Val

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Efficient CNF Simplification Based on Binary Implication Graphs

This page was built for publication: Simplifying Binary Propositional Theories into Connected Components Twice as Fast