Anders Møller and Michael Schwartzbach, February 2006
|
|
NOTE:
These slides have not been updated since 2003. They have been superseded by the book
Anders Møller and Michael Schwartzbach, February 2006 |
  
| INTERACTIVE WEB SERVICES WITH JAVA |
  
|
A simple uniform constraint model will handle many cases, including the previous example.
Each field is given a binary decision tree:
The nodes are boolean expressions combining predicates with and, or, and not.
The leaves are predicates that are required to hold for the given field.
|
| COPYRIGHT © 2002-2003 ANDERS MØLLER & MICHAEL I. SCHWARTZBACH |
|