A novel framework for systematic propositional formula simplification based on existential graphs (2405.17072v1)
Abstract: This paper presents a novel simplification calculus for propositional logic derived from Peirce's existential graphs' rules of inference and implication graphs. Our rules can be applied to propositional logic formulae in nested form, are equivalence-preserving, guarantee a monotonically decreasing number of variables, clauses and literals, and maximise the preservation of structural problem information. Our techniques can also be seen as higher-level SAT preprocessing, and we show how one of our rules (TWSR) generalises and streamlines most of the known equivalence-preserving SAT preprocessing methods. In addition, we propose a simplification procedure based on the systematic application of two of our rules (EPR and TWSR) which is solver-agnostic and can be used to simplify large Boolean satisfiability problems and propositional formulae in arbitrary form, and we provide a formal analysis of its algorithmic complexity in terms of space and time. Finally, we show how our rules can be further extended with a novel n-ary implication graph to capture all known equivalence-preserving preprocessing procedures.
- Anders, M. SAT preprocessors and symmetry. In Meel, K. S. and Strichman, O., editors, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel 2022, volume 236 of LIPIcs, pp. 1:1–1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
- A linear-time algorithm for testing the truth of certain quantified boolean formulas. In Inf. Process. Lett. 1979, volume 8, pp. 121–123.
- Bacchus, F. Enhancing davis putnam with extended binary clause reasoning. In Dechter, R., Kearns, M. J., and Sutton, R. S., editors, Proceedings of the 18th National Conference on AI and 14th Conference on Innovative Applications of AI, July 28 - August 1, 2002, Edmonton, Alberta, Canada 2002, pp. 613–619. AAAI Press / The MIT Press.
- Berre, D. L. Exploiting the real power of unit propagation lookahead. In Electron. Notes Discret. Math. 2001, volume 9, pp. 59–80.
- CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In Balyo, T., Froleyks, N., Heule, M., Iser, M., Järvisalo, M., and Suda, M., editors, Proc. of SAT Competition 2020 – Solver and Benchmark Descriptions 2020, volume B-2020-1 of Department of Computer Science Report Series B, pp. 51–53. University of Helsinki.
- Preprocessing in SAT solving. In Biere, A., Heule, M., van Maaren, H., and Walsh, T., editors, Handbook of Satisfiability - 2nd Edition 2021, volume 336 of Frontiers in Artificial Intelligence and Applications, pp. 391–435. IOS Press.
- ABC: an academic industrial-strength verification tool. In Touili, T., Cook, B., and Jackson, P. B., editors, Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings 2010, volume 6174 of Lecture Notes in Computer Science, pp. 24–40. Springer.
- Dau, F. 2008. Mathematical Logic with Diagrams – Based on the Existential Graphs of Peirce. Habilitation thesis. TU Darmstadt, Germany.
- Applying logic synthesis for speeding up SAT. In Marques-Silva, J. and Sakallah, K. A., editors, Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings 2007, volume 4501 of Lecture Notes in Computer Science, pp. 272–286. Springer.
- Incremental inprocessing in SAT solving. In Janota, M. and Lynce, I., editors, Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings 2019, volume 11628 of Lecture Notes in Computer Science, pp. 136–154. Springer.
- Gelder, A. V. Toward leaner binary-clause reasoning in a satisfiability solver. In Ann. Math. Artif. Intell. 2005, volume 43, pp. 239–253.
- Satisfiability testing with more reasoning and less guessing. In Johnson, D. S. and Trick, M. A., editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993 1993, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 559–586. DIMACS/AMS.
- Clause elimination procedures for CNF formulas. In Fermüller, C. G. and Voronkov, A., editors, Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings 2010, volume 6397 of Lecture Notes in Computer Science, pp. 357–371. Springer.
- Efficient CNF simplification based on binary implication graphs. In Sakallah, K. A. and Simon, L., editors, Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings 2011, volume 6695 of Lecture Notes in Computer Science, pp. 201–215. Springer.
- Inprocessing rules. In Gramlich, B., Miller, D., and Sattler, U., editors, Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings 2012, volume 7364 of Lecture Notes in Computer Science, pp. 355–370. Springer.
- Karnaugh, M. The map method for synthesis of combinational logic circuits. In Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics 1953, volume 72, pp. 593–599. IEEE.
- Clause vivification by unit propagation in CDCL SAT solvers. In Artif. Intell. 2020, volume 279.
- Li, C. M. Integrating equivalency reasoning into davis-putnam procedure. In Kautz, H. A. and Porter, B. W., editors, Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on on Innovative Applications of Artificial Intelligence, July 30 - August 3, 2000, Austin, Texas, USA 2000, pp. 291–296. AAAI Press / The MIT Press.
- An effective learnt clause minimization approach for CDCL SAT solvers. In Sierra, C., editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 2017, pp. 703–711. ijcai.org.
- McCluskey, E. J. Minimization of Boolean functions. In The Bell System Technical Journal 1956, volume 35, pp. 1417–1444. Nokia Bell Labs.
- Peirce, C. 1909. Existential graphs: manuscript 514, with commentary by JF Sowa. Self-published by JF Sowa [online]. URL: http://www.jfsowa.com/peirce/ms514.htm.
- Reger, G. Better proof output for vampire. In Kovács, L. and Voronkov, A., editors, Vampire@IJCAR 2016. Proceedings of the 3rd Vampire Workshop, Coimbra, Portugal, July 2, 2016 2016, volume 44 of EPiC Series in Computing, pp. 46–60. EasyChair.
- Roberts, D. D. 1973. The existential graphs of Charles S. Peirce. Mouton.
- Rudell, R. L. 1989. Logic synthesis for VLSI design. PhD thesis, University of California, Berkeley.
- Shin, S. Reconstituting beta graphs into an efficacious system. In J. Log. Lang. Inf. 1999, volume 8, pp. 273–295.
- Minimizing learned clauses. In Kullmann, O., editor, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings 2009, volume 5584 of Lecture Notes in Computer Science, pp. 237–243. Springer.
- Sowa, J. F. Peirce’s tutorial on existential graphs. In Semiotica 2011, volume 2011, pp. 347–394.
- Tseitin, G. S. On the complexity of derivation in propositional calculus. In Automation of Reasoning: 2: Classical Papers on Computational Logic 1967–1970 1983, pp. 466–483. Springer.
- Zeman, J. J. 1964. The graphical logic of C. S. Peirce. PhD thesis, The University of Chicago.