This chapter describes decision tables, also called decision-action tables. While they resemble truth tables in some respects, they are not truth tables. They can be used to plan and to document program designs. After studying this material you should be able to
-
1.
Translate program designs expressed in English into equivalent program designs expressed as decision tables and vice versa.
-
2.
Simplify decision tables.
-
3.
Analyze program designs expressed as decision tables for consistency, completeness, and redundancy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
Lover, R. (2008). Truth Functional Properties of Program Designs. In: Elementary Logic. Springer, London. https://doi.org/10.1007/978-1-84800-082-7_12
Download citation
DOI: https://doi.org/10.1007/978-1-84800-082-7_12
Publisher Name: Springer, London
Print ISBN: 978-1-84800-081-0
Online ISBN: 978-1-84800-082-7
eBook Packages: Computer ScienceComputer Science (R0)