LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
sav08:deciding_quantifier-free_fol [2008/04/17 13:30]
vkuncak
sav08:deciding_quantifier-free_fol [2008/04/23 06:49]
vkuncak
Line 16: Line 16:
 \] \]
  
-===== Congruence Closure Algorithm ===== 
- 
-Recall [[Herbrand Universe for Equality]]. 
- 
-What can we assume about the domain of interpretations of $a,b,f$? ++ | they are interpreted over elements of factor structure of ground terms ++ 
- 
-Recall [[Axioms for Equality]]. 
- 
-The family of all congruences that contain a given relation. 
- 
-Closure under intersection. 
- 
-Iterative algorithm for finding congruence closure.