Seung Gu Kang, Jeff Weber, et al.
ACS Fall 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.
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
Lars Graf, Thomas Bohnstingl, et al.
NeurIPS 2025
Joseph Y. Halpern
aaai 1996
Cristina Cornelio, Judy Goldsmith, et al.
JAIR