Abstract
This chapter presents basic concepts such as formal proofs, the satisfiability problem, soundness and completeness, and the trade-off between expressiveness and decidability. It also includes the theoretical basis for the rest of the book.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kroening, D., Strichman, O. (2016). Introduction and Basic concepts. In: Decision Procedures. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-50497-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-50497-0_1
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)