Amy Lin, Sujit Roy, et al.
AGU 2024
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.
Amy Lin, Sujit Roy, et al.
AGU 2024
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
C.A. Micchelli, W.L. Miranker
Journal of the ACM
Xiaoxiao Guo, Shiyu Chang, et al.
AAAI 2019