A framework for satisfiability modulo theories

DOI10.1007/s00165-009-0105-zzbMath1192.68647OpenAlexW2009348615MaRDI QIDQ1037239

Ofer Strichman, Daniel Kroening

Publication date: 13 November 2009

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-009-0105-z

zbMATH Keywords

propositional logicdeductive system

Mathematics Subject Classification ID

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

Uses Software

• SATIRE
• Chaff
• CVC
• ICS

Cites Work

• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Computer Aided Verification
• Splitting on Demand in SAT Modulo Theories
• Computer Aided Verification
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A framework for satisfiability modulo theories