Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/171905
21 Visitors26 Hits0 Downloads
Title
Let's talk about NLP and automated reasoning without getting grey hair
Related
Clematide, Simon; Klenner, Manfred and Volk, Martin. Searching answers : Festschrift in honour of Michael Hess on the occasion of his 60th birthday, p.119-126
Progress in the field of knowledge-based natural language processing is closely related to progress in the field of automated reasoning. Instead of focusing on full natural languages that are probably the most expressive and flexible knowledge representation languages that exist, I will argue that it is a better strategy to look at well-defined subsets of natural language that have the same expressivity as the formal languages that automated theorem provers can process. In particular, I will look at the two description logic reasoners CEL and RacerPro and the first-order logic theorem prover and model-generator EKRHyper and discuss what subsets of natural language can be processed and what kind of inferences are supported by these tools.