Conference paper
Representing and Reasoning with Defaults for Learning Agents
Benjamin N. Grosof
AAAI-SS 1993
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.
Benjamin N. Grosof
AAAI-SS 1993
Arnold.L. Rosenberg
Journal of the ACM
Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025