881 search results - page 38 / 177 » Solving satisfiability problems with preferences |
JALC
2002
13 years 8 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
FUIN
2010
13 years 7 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
CP
1997
Springer
14 years 26 days ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...