Sciweavers

CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
ERCIMDL
2007
Springer
114views Education» more  ERCIMDL 2007»
13 years 11 months ago
Semantics and Pragmatics of Preference Queries in Digital Libraries
As information becomes available in increasing amounts, and to growing numbers of users, the shift towards a more user-centered, or personalized access to information becomes cruci...
Elhadji Mamadou Nguer