2000 character limit reached
Using Description Logics for Recognising Textual Entailment (0710.2988v1)
Published 16 Oct 2007 in cs.CL
Abstract: The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natural language semantics in DLs inspired by existing representations in first-order logic. But our most significant contribution is the definition of two novel inference tasks: A-Box saturation and subgraph detection which are crucial for our approach to RTE.