Sciweavers

1634 search results - page 95 / 327
» Reasoning about Knowledge Using Rough Sets
Sort
View
LREC
2010
141views Education» more  LREC 2010»
13 years 11 months ago
Building Textual Entailment Specialized Data Sets: a Methodology for Isolating Linguistic Phenomena Relevant to Inference
This paper proposes a methodology for the creation of specialized data sets for Textual Entailment, made of monothematic Text-Hypothesis pairs (i.e. pairs in which only one lingui...
Luisa Bentivogli, Elena Cabrio, Ido Dagan, Danilo ...
XPU
2010
Springer
13 years 8 months ago
Auto-tagging Emails with User Stories Using Project Context
Abstract. In distributed agile teams, people often use email as a knowledge sharing tool to clarify the project requirements (aka user stories). Knowledge about the project include...
S. M. Sohan, Michael M. Richter, Frank Maurer
IRAL
2003
ACM
14 years 3 months ago
Question-Answering based on virtually integrated lexical knowledge base
This paper proposes an algorithm for causality inference based on a set of lexical knowledge bases that contain information about such items as event role, is-a hierarchy, relevan...
Key-Sun Choi, Jae-Ho Kim, Masaru Miyazaki, Jun Got...
IEAAIE
2001
Springer
14 years 2 months ago
A Knowledge Model for Automatic Configuration of Traffic Messages
: This paper describes a knowledge model for a configuration problem in the domain of traffic control. The goal of this model is to help traffic engineers in the dynamic selection ...
Martín Molina, Mónica Robledo
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...