Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
2007
Files
Details
Title
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Author(s)
Kuncak, Viktor ; Rinard, Martin
Published in
Automated Deduction – CADE-21
Pages
215–230
Conference
Conference on Automateded Deduction (CADE-21)
Date
2007
Other identifier(s)
View record in Web of Science
Laboratories
LARA
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LARA - Laboratory for Automated Reasoning and Analysis
Work outside EPFL
Conference Papers
Published
Work outside EPFL
Conference Papers
Published
Record creation date
2007-08-21