{"paper":{"title":"The Generalized A* Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. McAllester, P. F. Felzenszwalb","submitted_at":"2011-10-10T22:14:15Z","abstract_excerpt":"We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules.  A large variety of inference problems in AI can be formulated in this framework.  We generalize A* search and heuristics derived from abstractions to a broad class of lightest derivation problems.  We also describe a new algorithm that searches for lightest derivations using a hierarchy of abstractions.  Our generalization of A* gives a new algorithm for searching AND/OR graphs in a bottom-up fashion. \nWe discuss how the algorithms described here provide a general architecture for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2216","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}