Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019
Jihun Yun, Peng Zheng, et al.
ICML 2019
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025