Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Subject "polynomial time"
Now showing items 1-1 of 1
-
Tractable Inference Relations
(1991-12-01)We consider the concept of local sets of inference rules. Locality is a syntactic condition on rule sets which guarantees that the inference relation defined by those rules is polynomial time decidable. Unfortunately, ...