881 search results - page 7 / 177 » Solving satisfiability problems with preferences |
ICRA
1993
IEEE
14 years 22 days ago
1993
IEEE
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
GECCO
2009
Springer
13 years 6 months ago
2009
Springer
Public data sharing is utilized in a number of businesses to facilitate the exchange of information. Privacy constraints are usually enforced to prevent unwanted inference of info...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
LATA
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...