Skip to main content

1999 | OriginalPaper | Buchkapitel

Complexity of the Higher Order Matching

verfasst von : ToMasz Wierzbicki

Erschienen in: Automated Deduction — CADE-16

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

We use the standard encoding of Boolean values in simply typed lambda calculus to develop a method of translating SAT problems for various logics into higher order matching. We obtain this way already known NP-hardness bounds for the order two and three and a new result that the fourth order matching is NEXPTIME-hard

Metadaten
Titel
Complexity of the Higher Order Matching
verfasst von
ToMasz Wierzbicki
Copyright-Jahr
1999
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-48660-7_6

Neuer Inhalt