An experiment with satisfiability modulo SAT

DOI10.1007/s10817-015-9354-0zbMath1356.68208OpenAlexW2262466478MaRDI QIDQ287334

Han-Tao 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

propositional satisfiabilitymagic squaressatisfiability modulo theory

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Uses Software

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

Cites Work

• Unnamed Item
• Unsolved problems on magic squares
• The existence and application of strongly idempotent self-orthogonal row Latin magic arrays
• A family of pandiagonal bimagic squares based on orthogonal arrays
• Solving SAT and SAT Modulo Theories
• SATO: An efficient propositional prover
• A machine program for theorem-proving
• Computer Aided Verification
• Principles and Practice of Constraint Programming – CP 2004

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