Sciweavers

5595 search results - page 3 / 1119
» Comparing Subsumption Optimizations
Sort
View
DEBS
2007
ACM
13 years 6 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
EDBT
2010
ACM
188views Database» more  EDBT 2010»
13 years 11 months ago
Subsumption and complementation as data fusion operators
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
Jens Bleiholder, Sascha Szott, Melanie Herschel, F...
FLAIRS
2008
13 years 7 months ago
Paraphrase Identification with Lexico-Syntactic Graph Subsumption
The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relati...
Vasile Rus, Philip M. McCarthy, Mihai C. Lintean, ...
ICLP
2010
Springer
13 years 8 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
ICML
2008
IEEE
14 years 5 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka