The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
Lorenzo ClementePawel ParysSylvain SalvatiIgor WalukiewiczPublished in: LICS (2016)
Keyphrases
- higher order
- lower order
- datalog programs
- transitive closure
- high order
- pairwise
- natural images
- first order logic
- markov random field
- neural network
- database systems
- low order
- query answering
- lambda calculus
- data sets
- polynomial hierarchy
- complex objects
- covariance matrix
- expressive power
- conditional random fields
- data management
- similarity measure
- image segmentation