Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
 
conference paper

Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

Kuncak, Viktor  orcid-logo
•
Rinard, Martin
2007
Automated Deduction – CADE-21
Conference on Automateded Deduction (CADE-21)
  • Files
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-540-73595-3_15
Web of Science ID

WOS:000248112500015

Author(s)
Kuncak, Viktor  orcid-logo
Rinard, Martin
Date Issued

2007

Published in
Automated Deduction – CADE-21
Start page

215

End page

230

Written at

OTHER

EPFL units
LARA  
Event name
Conference on Automateded Deduction (CADE-21)
Available on Infoscience
August 21, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/10403
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés