413 search results - page 31 / 83 » On the Relation Between ID-Logic and Answer Set Programming |
157
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
141
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
135
Voted
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
133
Voted
ACL
2010
15 years 1 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
159
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...