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

Let me begin with a brief discussion of the name of this chapter: the adjective “advanced” in
the title can only be understood in the temporal sense; the bulk of Urquhart's chapter in this …

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 …

Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a
generalised notion of literal, called signed literal. A signed literal is an expression of the form …

This paper contains an experimental study of the impact of the construction strategy of
reduced, ordered binary decision diagrams (ROBDDs) on the average-case computational …

In this paper we present a new and extremely competitive approach to solving a notoriously
hard problem from the sports scheduling domain, the round robin problem. By combining …

In this paper we first define a reduction/spl delta/that transforms an instance/spl Gamma/of
Regular-SAT into a satisfiability equivalent instance/spl Gamma//sup/spl delta//of SAT. The …

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 …

We present Regular-SAT, an extension of Boolean Satisfiability basedon a class of many-
valuedCNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows …

In this paper we describe new local search algorithms for regular CNF formulas and
investigate their suitability for solving problems from the domains of graph coloring and …