Home
Hostname: page-component-684899dbb8-t7hbd Total loading time: 0.388 Render date: 2022-05-18T10:45:24.705Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

# 2 - Boolean equations

## from Part I - Foundations

Published online by Cambridge University Press:  01 June 2011

## Summary

The solution of Boolean equations is arguably the most fundamental problem arising in the theory of Boolean functions. Actually, the quote at the beginning of Chapter 1 shows that an important aspect of Boole's original research program was essentially to reduce logic to the solution of Boolean equations. Although his hopes eventually proved overly optimistic, it will become clear in subsequent chapters of this book that Boolean equations often arise as subproblems to be solved in the course of tackling more complex problems. Therefore, their solution is a cornerstone of many Boolean algorithms.

In this chapter, we present some representative models involving Boolean equations and describe various algorithmic procedures for their solution: branching, variable elimination, the consensus method, and mathematical programming approaches. In view of the importance of this topic, we spend quite a lot of time discussing the details of classical procedures, their interrelations, respective merits, and complexity. In the last section, we generalize the basic consistency-testing problem in several ways: We examine the problems of counting and of generating all solutions of a Boolean equation and briefly discuss the maximum satisfiability (Max Sat) problem.

Definitions and applications

Definition 2.1.A Boolean equation is an equation of the form ϕ(X) = ψ(X), where X = (x1,x2,…, xn) is a vector of Boolean variables, and ϕ,ψ are Boolean expressions in these variables. A solution of the equation is a point X* ∈ Bn such that ϕ(X*) = ψ(X*).

Type
Chapter
Information
Boolean Functions
Theory, Algorithms, and Applications
, pp. 67 - 122
Publisher: Cambridge University Press
Print publication year: 2011

## Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

### Purchase

Buy print or eBook[Opens in a new window]

# Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

• Boolean equations
• Book: Boolean Functions
• Online publication: 01 June 2011
• Chapter DOI: https://doi.org/10.1017/CBO9780511852008.003
Available formats
×

# Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

• Boolean equations
• Book: Boolean Functions
• Online publication: 01 June 2011
• Chapter DOI: https://doi.org/10.1017/CBO9780511852008.003
Available formats
×

# Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

• Boolean equations
• Book: Boolean Functions
• Online publication: 01 June 2011
• Chapter DOI: https://doi.org/10.1017/CBO9780511852008.003
Available formats
×