Skip to main content
Infoscience
English
French
Log In
Log in with EPFL account
Infoscience
English
French
Log In
Log in with EPFL account
Home
Academic and Research Output
Conferences, Workshops, Symposiums, and Seminars
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
conference paper
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Kuncak, Viktor
•
Rinard, Martin
2007
Automated Deduction – CADE-21
Conference on Automateded Deduction (CADE-21)
Files
Details
Metrics
