Approximate Pattern Matching is Expressible in Transitive Closure Logic.
Kjell LemströmLauri HellaPublished in: LICS (2000)
Keyphrases
- transitive closure
- approximate pattern matching
- pattern matching
- expressive power
- constraint databases
- recursive queries
- query evaluation
- first order logic
- directed acyclic graph
- query language
- spatial databases
- datalog queries
- relational algebra
- string matching
- artificial intelligence
- machine learning
- structured data
- object oriented
- databases
- metadata