Sciweavers

8437 search results - page 478 / 1688
» Preferences over Sets
Sort
View
AMW
2010
15 years 8 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
NAACL
2007
15 years 8 months ago
First-Order Probabilistic Models for Coreference Resolution
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
Aron Culotta, Michael L. Wick, Andrew McCallum
COLING
2000
15 years 8 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
AAAI
1990
15 years 8 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle
ISI
2008
Springer
15 years 7 months ago
Visual Analytics for Supporting Entity Relationship Discovery on Text Data
To conduct content analysis over text data, one may look out for important named objects and entities that refer to real world instances, synthesizing them into knowledge relevant ...
Hanbo Dai, Ee-Peng Lim, Hady Wirawan Lauw, HweeHwa...