Login / Signup

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.

Jean H. GallierPaliath NarendranDavid A. PlaistedStan RaatzWayne Snyder
Published in: CADE (1988)
Keyphrases
  • rewriting systems
  • finite number
  • query patterns
  • definite clause
  • finite sets