Sciweavers

12459 search results - page 366 / 2492
» cans 2006
Sort
View
177
Voted
JAIR
2010
111views more  JAIR 2010»
15 years 5 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
218
Voted
JAPLL
2010
179views more  JAPLL 2010»
15 years 5 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
174
Voted
JASIS
2010
182views more  JASIS 2010»
15 years 5 months ago
Understanding latent semantic indexing: A topological structure analysis using Q-analysis
Abstract – The method of latent semantic indexing (LSI) is well known for tackling the synonymy and polysemy problems in information retrieval. However, its performance can be ve...
Dandan Li, Chung-Ping Kwong
JCSS
2010
112views more  JCSS 2010»
15 years 5 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
JDWM
2010
139views more  JDWM 2010»
15 years 5 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...