Login / Signup

Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth.

Mateus de Oliveira Oliveira
Published in: IPEC (2016)
Keyphrases
  • term rewriting systems
  • fixed parameter tractable
  • parameterized complexity
  • functional programs
  • computational problems
  • logic programs
  • np complete
  • search space
  • data sources
  • object oriented
  • conjunctive queries