Fachbereich Informatik
Refine
Keywords
- higher order tableau (1) (remove)
-
Higher-Order Automated Theorem Proving for Natural Language Semantics
(1998)
- This paper describes a tableau-based higher-order theorem prover HOT and an application to natural language semantics. In this application, HOT is used to prove equivalences using world knowledge during higher-order unification (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
