Complexity of the higher order matching

Authors:
Tomasz Wierzbicki
Affiliations:
-
Venue:
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Year:
1999

Citing 5
Cited 3

The clausal theory of types

The clausal theory of types
Linear Interpolation for the Higher-Order Matching Problem

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Higher-Order Matching and Tree Automata

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
The "Hardest'' Natural Decidable Theory

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The complexity of unification.

The complexity of unification.

The role of polymorphism in the characterisation of complexity by soft types

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A game-theoretic approach to deciding higher-order matching

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Higher-order matching and games

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.