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  
•
Rinard, Martin
2007
Automated Deduction – CADE-21
Conference on Automateded Deduction (CADE-21)
  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

KuncakRinard07TowardsEfficientSatisfiabilityCheckingBoolean.pdf

Access type

openaccess

Size

304.64 KB

Format

Adobe PDF

Checksum (MD5)

9bb10ba7c4175158cdfe9e4babf44d27

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