Login / Signup

Regaining cut admissibility in deduction modulo using abstract completion.

Guillaume BurelClaude Kirchner
Published in: Inf. Comput. (2010)
Keyphrases
  • inference rules
  • theorem proving
  • higher level
  • automated deduction
  • databases
  • high level
  • database systems
  • intuitionistic logic