Login / Signup

An Universal Termination Condition for Solving Goals in Equational Languages.

Gianni AguzziU. ModiglianiM. Cecilia Verri
Published in: CTRS (1990)
Keyphrases
  • expressive power
  • databases
  • language independent
  • theorem proving
  • sufficient conditions
  • type checking
  • term rewriting
  • machine learning
  • theorem prover
  • solving problems
  • database
  • natural language
  • cross lingual