\textsf{TSAT++}: an open platform for satisfiability modulo theories

MaRDI QIDQ2848055zbMATH OpenFDO

Authors Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Massimo Idini, Marco Maratea

Publication date 25 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S157106610505070X

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Satisfiability modulo theories
• An Abstract Framework for Satisfiability Modulo Theories
• Lazy satisfiability modulo theories
• A survey of satisfiability modulo theory
• A modular approach to MaxSAT modulo theories

Cited in

(7)

• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• Modelling and solving temporal reasoning as propositional satisfiability
• Modular strategic SMT solving with \textbf{SMT-RAT}
• \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
• A modular approach to MaxSAT modulo theories
• ASP-based approaches for solving the nuclear medicine scheduling problem
• The SAT-based approach to separation logic

Describes a project that uses

Uses Software

• TSAT++
• SMT-LIB
• CVC

This page was built for publication: \textsf{TSAT++}: an open platform for satisfiability modulo theories

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