Monday, May 9, 2016

Graph logics

The paper Simulate transitive closure using FO logic uses first-order theorem provers to prove transitive closures of certain binary predicates.

Courcelle's theorem
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)