[Index] || [Contents] || [Grades] Mon Mar 3 14:43:01 PST 2003

656/556 2003 1w 05 Semantics Assigned work due: Exercise 1e from Ex1.7 on page 43: hand in parse tree for: p -> (~q \/ (q -> p)) chapter 1.4 meaning |= vs |- truth tables induction? soundness completeness Exercises: Better Tables Handout: http://www.csci.csusb.edu/dick/cs656/tables.pdf Compressed Truth Tables Karnaugh Maps (See hardware classes) Extended Karnaugh Maps Parnas Function Tables McMaster University California. Decision Tables Calculating completeness and consistency. Extended Entry Decision Tables Fashionable 20-30 years ago in DP/IS. And/Or Tables Used in the TCAS II project. Tool developed as MS project here. Semantic Tableaux Expands a set of formulae into a tree of formula. Branches with contradictions are closed. Proof by closing all counter examples. Example on BB Handout Expressing PC wffs in C/C++/Java T ---> 1 F ---> 0 \/ --> || /\ --> && and so on Boolean Algebra and Data If time: Examples Exercise: translate ( P/\Q)\/(P/\(-Q))\/(R/\P)\/( R/\(-P))\/((-R)/\(-P)) into C/C++/Java Condition. Assigned work. Can you translate P->Q into a C/C++/Java Condition? (Hint: Write out the truth table using 0 and 1... and look at it) Assigned Work: TBA from Ex1.8(pages 49-51) or Ex1.11 (pages 66-68) Lab: Write a C/ C++/Java program that evaluates this proposition: ( P/\Q)\/(P/\(-Q))\/(R/\P)\/( R/\(-P))\/((-R)/\(-P)) for every possible truth value of its propositions and lists the results. Your program should handle this AND ONLY this proposition. Go to Chen-Hsiu Lee's MS Project: It translates PC wffs into And/Or tables. http://139.182.137.37:8080/tpl/table.jsp Try the page out. Next Normal Forms: Study 1.5 + Ex1.12-1.15 http://www.csci.csusb.edu/dick/cs656/class/06.html