Jihun Yun, Peng Zheng, et al.
ICML 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.
Jihun Yun, Peng Zheng, et al.
ICML 2019
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
Ira Pohl
Artificial Intelligence
Cristina Cornelio, Judy Goldsmith, et al.
JAIR