Login / Signup

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.

Hubert ComonGuillem GodoyRobert Nieuwenhuis
Published in: FOCS (2001)
Keyphrases
  • term rewrite systems
  • polynomial hierarchy
  • special case
  • rewrite rules
  • computational complexity
  • definite clause
  • np complete
  • database systems
  • np hard
  • first order logic
  • datalog programs
  • dnf formulas
  • function symbols