Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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.
Joseph Y. Halpern
aaai 1996
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024