skip to main content
Lingue:
Cerca la mia strategia di ricerca: Mostra risultati con: Mostra risultati con:

Polynomial-time computation via local inference relations

Givan, Robert ; Mcallester, David

ACM Transactions on Computational Logic (TOCL), 2002-10-01, Vol.3 (4), p.521-541 [Rivista Peer Reviewed]

Fulltext non disponibile

Vedi tutte le versioni
Citazioni Citato da
  • Titolo:
    Polynomial-time computation via local inference relations
  • Autore: Givan, Robert ; Mcallester, David
  • Editore: ACM
  • Note di contenuto: We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time evaluation strategies for a large variety of rule sets that cannot be given terminating evaluation strategies by any other known automatic technique. This article discusses three new results. First, it is shown that every polynomial-time predicate can be defined by an (unstratified) local rule set. Second, a new machine-recognizable subclass of the local rule sets is identified. Finally, we show that locality, as a property of rule sets, is undecidable in general.
  • Fa parte di: ACM Transactions on Computational Logic (TOCL), 2002-10-01, Vol.3 (4), p.521-541
  • Soggetti: decision procedures ; Automated reasoning ; descriptive complexity theory
  • Lingua: Inglese
  • Tipo: Articolo
  • Identificativo: ISSN: 1529-3785
    EISSN: 1557-945X
    DOI: 10.1145/566385.566387

Ricerca in corso nelle risorse remote ...