Yale Song, Zhen Wen, et al.
IJCAI 2013
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.
Yale Song, Zhen Wen, et al.
IJCAI 2013
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence