Sciweavers

175 search results - page 15 / 35
» Generalizing stable semantics by preferences
Sort
View
LPNMR
2004
Springer
14 years 26 days ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel
RWEB
2005
Springer
14 years 1 months ago
Personalization for the Semantic Web
Searching for the meaning of the word “personalization” on a popular search engine, one finds twenty-three different answers, including “the process of matching categorized...
Matteo Baldoni, Cristina Baroglio, Nicola Henze
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
12 years 10 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
ECSQARU
2009
Springer
14 years 2 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 7 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...