FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Theory and Applications of Satisfiability Testing – SAT 2019

Mikoláš Janota
    Product form
      FORMAT: Paperback / softback

      R 2,196.21 Price and availability exclusive to website

      YOU COULD EARN 2,196.21 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 366.03 per month!
      3x monthly payments of R 732.07 with
      4x fortnightly payments of R 549.05 with
      This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
      Format: Paperback / softback CONTRIBUTORS: Mikoláš Janota EAN: 9783030242572 COUNTRY: Switzerland PAGES: WEIGHT: 670 g HEIGHT: 235 cm
      PUBLISHED BY: Springer Nature Switzerland AG DATE PUBLISHED: 2019-06-29 CITY: GENRE: COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Programming / Algorithms, COMPUTERS / Hardware / Cell Phones & Devices WIDTH: 155 cm SPINE:

      Book Themes:

      Numerical analysis, Information technology: general topics, Software Engineering, Mathematical theory of computation, Systems analysis and design, Artificial intelligence

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
      Format: Paperback / softback CONTRIBUTORS: Mikoláš Janota EAN: 9783030242572 COUNTRY: Switzerland PAGES: WEIGHT: 670 g HEIGHT: 235 cm
      PUBLISHED BY: Springer Nature Switzerland AG DATE PUBLISHED: 2019-06-29 CITY: GENRE: COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Programming / Algorithms, COMPUTERS / Hardware / Cell Phones & Devices WIDTH: 155 cm SPINE:

      Book Themes:

      Numerical analysis, Information technology: general topics, Software Engineering, Mathematical theory of computation, Systems analysis and design, Artificial intelligence

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account