Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations.
Georg MoserAndreas SchnablJohannes WaldmannPublished in: FSTTCS (2008)
Keyphrases
- context dependent
- complexity analysis
- term rewriting
- theorem prover
- theorem proving
- first order logic
- theoretical analysis
- semantic level
- operational semantics
- natural language
- context free
- lower bound
- knuth bendix
- rewrite systems
- low level
- computational complexity
- high level
- user centric
- inference rules
- knowledge base
- singular value decomposition
- data model
- data mining
- logic programming
- graphical models