Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
sav08:homework11 [2008/05/08 18:54] vkuncak |
sav08:homework11 [2008/05/15 12:58] vkuncak |
||
|---|---|---|---|
| Line 30: | Line 30: | ||
| ===== Problem 2 ===== | ===== Problem 2 ===== | ||
| - | Suppose you are given a set of predicates ${\cap P} = \{P_0,P_1,\ldots,P_n\}$ in a decidable theory of first-order logic (for example, combination of uninterpreted function symbols with integer linear arithmetic) where $P_0$ is the predicate 'false'. | + | Suppose you are given a set of predicates ${\cap P} = \{P_0,P_1,\ldots,P_n\}$ in a decidable theory of first-order logic (for example, quantifier-free formulas in the combination of uninterpreted function symbols with integer linear arithmetic) where $P_0$ is the predicate 'false'. |
| **Part a)** Consider [[Conjunctions of Predicates]] as abstract interpretation domain. Give example showing that it need not be the case that | **Part a)** Consider [[Conjunctions of Predicates]] as abstract interpretation domain. Give example showing that it need not be the case that | ||