Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
sav08:solving_set_constraints_using_monadic_class [2010/05/31 13:36]
vkuncak
sav08:solving_set_constraints_using_monadic_class [2010/05/31 13:36] (current)
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 [[Lecture 15]]+  * Deciding MSOL over Strings and Trees in [[sav10:Lecture 15]]
  
 ===== Equisatisfiability of Monadic Class and Set Constraints ===== ===== Equisatisfiability of Monadic Class and Set Constraints =====
 
sav08/solving_set_constraints_using_monadic_class.txt · Last modified: 2010/05/31 13:36 by vkuncak
 
© EPFL 2018 - Legal notice