Dzung Phan, Vinicius Lima
INFORMS 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.
Dzung Phan, Vinicius Lima
INFORMS 2023
Yale Song, Zhen Wen, et al.
IJCAI 2013
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Barry K. Rosen
SWAT 1972