100 likes | 219 Views
A Solution in Finite Domain. Measuring With Jugs. * variables -- a set of alphanumeric characters starting with a CAPITAL letter * atoms -- set of alphanumeric characters beginning with a lower case letter (anAtom in would be equivalent in Java to"anAtom")
E N D
A Solution in Finite Domain Measuring With Jugs
* variables -- a set of alphanumeric characters starting with a CAPITAL letter * atoms -- set of alphanumeric characters beginning with a lower case letter (anAtom in would be equivalent in Java to"anAtom") * keywords – declare, fun, Browse Intro to Oz
-- virtual strings a#b#c -- lists [a b c] -- records sol(A B C) #(a b c) Other Neat Stuff
This is what an Oz Program looks like: Functions
background -- others who have analyzed it explanation CapA*TimesA-CapA*TimesANeg The Algorithm
+ finite domain integers + constraints + how it works (as opposed to logic programming like Prolog) Constraint Programming
- 2 jugs - n jugs - show output - explain output numbers CapA*TimesA-CapA*TimesANeg Constraint Programming AppliedAlgorithm to Code
+ show structure of functions + show code bits + show output Numbers to Operations
May include this! Multiple Solutions
This shows that Finite Domain Constraint Programming is useful for areas where it might not at first seem useful. Conclusion