Skip to main content

From Propositional to Quantifier-Free Theories

  • 2534 Accesses

Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)

Abstract

This chapter studies a general framework that generalizes CDCL to a decision procedure for decidable quantifier-free first-order theories.

Keywords

  • Decision Procedure
  • Boolean Formula
  • Partial Assignment
  • Bibliographic Note
  • Antecedent Clause

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-662-50497-0_3
  • Chapter length: 18 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   44.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-50497-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   59.99
Price excludes VAT (USA)
Hardcover Book
USD   89.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel Kroening .

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kroening, D., Strichman, O. (2016). From Propositional to Quantifier-Free Theories. In: Decision Procedures. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-50497-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-50497-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-50496-3

  • Online ISBN: 978-3-662-50497-0

  • eBook Packages: Computer ScienceComputer Science (R0)