An experiment with satisfiability modulo SAT

DOI10.1007/S10817-015-9354-0MaRDI QIDQ287334zbMATH OpenOpenAlexFDO

Authors H. Zhang

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1007/s10817-015-9354-0

zbMATH Keywords

magic squarespropositional satisfiabilitysatisfiability modulo theory

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Recommendations

• SAT modulo intuitionistic implications
• A survey of satisfiability modulo theory
• Satisfiability modulo theories: an appetizer
• Satisfiability modulo theories and assignments
• A Tutorial on Satisfiability Modulo Theories
• A constructive investigation of satisfiability
• Satisfiability modulo theories
• A framework for satisfiability modulo theories

Cites work

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• A family of pandiagonal bimagic squares based on orthogonal arrays
• A machine program for theorem-proving
• Computer Aided Verification
• Principles and Practice of Constraint Programming – CP 2004
• SATO: An efficient propositional prover
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• The existence and application of strongly idempotent self-orthogonal row Latin magic arrays
• Unsolved problems on magic squares

Describes a project that uses

Uses Software

• Chaff
• z3
• cvc3
• SATO
• SMT-LIB

This page was built for publication: An experiment with satisfiability modulo SAT

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