Given a statement in logic can it ever be true? This is the satisfiability problem.We will confine our attention to the propositional calculus. However, the problem also arises in the predicate calculus where it is necessary to consider if there are instantiations of the variables which make a statement true. The problem is equivalent to the inference and consistency problems mentioned in Chapter 1.
This is a preview of subscription content, log in via an institution to check access.
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
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Williams, H.P. (2009). The Satisfiability Problem and Its Extensions. In: Logic and Integer Programming. International Series in Operations Research & Management Science, vol 130. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-92280-5_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-92280-5_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-92279-9
Online ISBN: 978-0-387-92280-5
eBook Packages: Computer ScienceComputer Science (R0)