An experiment with satisfiability modulo SAT

DOI10.1007/S10817-015-9354-0zbMATH Open1356.68208OpenAlexW2262466478MaRDI QIDQ287334FDOQ287334

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

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

zbMATH Keywords

magic squarespropositional satisfiabilitysatisfiability modulo theory

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cites Work

• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• A machine program for theorem-proving
• 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
• Title not available (Why is that?)
• SATO: An efficient propositional prover
• Computer Aided Verification
• Principles and Practice of Constraint Programming – CP 2004

Uses Software

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

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)