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/17 13:38]
vkuncak
Line 23: Line 23:
  
 Recall [[Axioms for Equality]]. Recall [[Axioms for Equality]].
 +
 +Suppose that there exists a model. ​ What do we know about the congruence?
  
 The family of all congruences that contain a given relation. The family of all congruences that contain a given relation.
  
 Closure under intersection. Closure under intersection.
 +
 +Existence of smallest congruence containing a given relation.
  
 Iterative algorithm for finding congruence closure. Iterative algorithm for finding congruence closure.
 +
 +===== References =====
 +
 +  * {{:​nelsonoppen80decisionprocedurescongruenceclosure.pdf|Decision Procedures Based on Congruence Closure}}
 +