Saurabh Paul, Christos Boutsidis, et al.
JMLR
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.
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Joseph Y. Halpern
aaai 1996
Amy Lin, Sujit Roy, et al.
AGU 2024
Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems