Subject: Boolean Satisfiability
From: "William J. Rapaport" <rapaport@buffalo.edu>
Date: Tue, 15 Sep 2009 14:19:04 -0400 (EDT)

There is an interesting article in last month's Communications of the
Association for Computing Machinery on the use of truth tables for
propositional logic to solve scheduling problems, seating assignments,
software verification, and other practical problems involved with the
satisfaction of constraints.

Given what we've been talking about in lecture, it's a timely article
that you might find helpful.

There's a link on the logic page:
http://www.cse.buffalo.edu/~rapaport/191/S09/logic.html

or link directly to:  
http://portal.acm.org/citation.cfm?id=1536637
(you may need to be on a UB computer to gain access to the ACM website)