Sciweavers

7123 search results - page 370 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICWL
2009
Springer
16 years 1 months ago
What If Annotations Were Reusable: A Preliminary Discussion
This paper discusses the rationale for the representation of user feedback in a structured and reusable format so that it can be reused by different recommender systems. We emphasi...
Nikos Manouselis, Riina Vuorikari
LOPSTR
2009
Springer
16 years 1 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
PPDP
2009
Springer
16 years 1 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
SUM
2009
Springer
16 years 1 months ago
An Analysis of Sum-Based Incommensurable Belief Base Merging
Different methods have been proposed for merging multiple and potentially conflicting informations. Sum-based operators offer a natural method for merging commensurable prioriti...
Salem Benferhat, Sylvain Lagrue, Julien Rossit
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina