Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
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.
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025