'Procedure propagate' presentation slideshows

Deciding Equality with Uninterpreted Functions using Congruence Closure

Deciding Equality with Uninterpreted Functions using Congruence Closure. Constantinos Bartzis. The problem. Determine the validity of formulas like f(a,b)=a ? f(f(a, b), b)=a or, equivalently, satisfiability of f(a,b)=a ? f(f(a, b), b) ? a In 1954 Ackermann showed it is decidable.

360 views • 24 slides