Baihan Lin, Guillermo Cecchi, et al.
IJCAI 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.
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Kellen Cheng, Anna Lisa Gentile, et al.
EMNLP 2024