Using Description Logics for Recognising Textual Entailment

Simple item page
dc.creatorBedaride, Paul
dc.date2007-10-16
dc.date.accessioned2026-07-07T08:36:35Z
dc.date.available2026-07-07T08:36:35Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0710.2988
dc.identifierhttp://arxiv.org/abs/0710.2988
dc.identifierDans 19th European Summer School in Logic, Language and Information (2007) 11-21
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140115
dc.subjectComputation and Language
dc.titleUsing Description Logics for Recognising Textual Entailment
dc.typetext

Files

Collections

arXiv