We define a collection of map**s that transform many-valued clausal forms into
satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them …

The purpose of this paper is to show that a well known machine learning technique based
on Decision Trees can be effectively used to select the best approach (in terms of efficiency) …

Much excitement has been generated by the success of stochastic local search procedures
at finding solutions to large, very hard satisfiability problems. Many of the problems on which …

We consider three distributed configuration tasks that arise in the setup and operation of
multi-hop wireless networks: partition into coordinating cliques, Hamiltonian cycle formation …

We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-
style calculus for solving signed Max-SAT. Based on these results, we then describe an …

Proof systems for SAT are unsound for MaxSAT because they preserve satisfiability but fail
to preserve the minimum number of unsatisfied clauses. Consequently, there has been a …

Many constraint satisfaction and optimisation problems can be expressed using linear
constraints on pseudo-Boolean (0/1) variables. Problems expressed in this form are usually …

Immersive Virtual Reality (VR) as a research tool provides numerous opportunities of what
one can do and see in a virtual world which is not possible in real world. Being able to fly is …

Identifying CSP variables in SAT encodings of combinatorial problems allows one to
incorporate CSP-like variable selection heuristics into SAT solvers. We show that such …

We show that we can design and implement extremely efficient variable selection heuristics
for SAT solvers by identifying, in Boolean clause databases, sets of Boolean variables that …