Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
sav08:solving_set_constraints_using_monadic_class [2008/05/22 13:16] vkuncak |
sav08:solving_set_constraints_using_monadic_class [2010/05/31 13:36] vkuncak |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| Decidability: special case of first-order theory of Boolean Algebras, or WS1S, so it can be decided using techniques we have seen: | Decidability: special case of first-order theory of Boolean Algebras, or WS1S, so it can be decided using techniques we have seen: | ||
| * [[Deciding Boolean Algebra with Presburger Arithmetic]] | * [[Deciding Boolean Algebra with Presburger Arithmetic]] | ||
| - | * Deciding MSOL over Strings and Trees in [[lecture23]] | + | * Deciding MSOL over Strings and Trees in [[Lecture 15]] |
| + | |||
| + | ===== Equisatisfiability of Monadic Class and Set Constraints ===== | ||
| + | |||
| + | If we take a formula in monadic class and | ||
| + | * flatten | ||
| + | * skolemize | ||
| + | * look at Herbrand universe | ||
| + | |||
| + | Then we obtain set constraints. | ||
| + | |||
| + | Converse is also true: for every set constraint there exists a corresponding formula in monadic class. | ||
| ===== References ===== | ===== References ===== | ||