Efficient Term-ITE Conversion for Satisfiability Modulo Theories

DOI10.1007/978-3-642-02777-2_20zbMath1247.68254OpenAlexW1521022632MaRDI QIDQ3637169

Hoonsang Jin, Hyondeuk Kim, Fabio Somenzi

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_20

Mathematics Subject Classification ID

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

Related Items

An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty, SPASS-SATT. A CDCL(LA) solver, A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic

Cites Work

• Simplification by Cooperating Decision Procedures
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Computer Aided Verification
• Lemma Learning in SMT on Linear Constraints
• Unnamed Item