Zobrazeno 1 - 1
of 1
pro vyhledávání: '"sSocratic proof systems"'
Autor:
Givan, Robert, McAllester, David
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, determining whether a given rule
Externí odkaz:
http://hdl.handle.net/1721.1/5969
