A complete diagrammatic calculus for Boolean satisfiability

DOI10.46298/ENTICS.10481MaRDI QIDQ6831513zbMATH OpenFDO

Authors Tao Gu, Robin Piedeleu, Fabio Zanasi

Publication date 2 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/ENTICS.10481

zbMATH Keywords

Boolean algebracategorical semanticslogic programmingsatisfiabilitystring diagrams

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• A Machine-Oriented Logic Based on the Resolution Principle
• A string diagrammatic axiomatisation of finite-state automata
• A survey of graphical languages for monoidal categories
• An Invitation to Applied Category Theory
• Cartesian bicategories. I
• Categories for Quantum Theory
• Coherence for compact closed categories
• Functorial Semantics as a Unifying Perspective on Logic Programming
• Graphical affine algebra
• Graphical Conjunctive Queries.
• Graphical piecewise-linear algebra
• scientific article; zbMATH DE number 5838699 (Why is no real title available?)
• scientific article; zbMATH DE number 3489106 (Why is no real title available?)
• scientific article; zbMATH DE number 1393359 (Why is no real title available?)
• Interacting Hopf algebras
• Logic programming and knowledge representation
• On the power of clause-learning SAT solvers as resolution engines
• The complexity of theorem-proving procedures
• The Compositional Structure of Multipartite Quantum Entanglement

This page was built for publication: A complete diagrammatic calculus for Boolean satisfiability

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