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 …

The implementation of effective reasoning tools for deciding the satisfiability of Quantified
Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many …

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 …

Much excitement has been generated by the recent success of stochastic local search
procedures at finding satisfying assignments to large formulas. Many of the problems on …

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 …

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 …

The Sequence constraint is useful in modelling car sequencing, rostering, scheduling and
related problems. We introduce half a dozen new encodings of the Sequence constraint …

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 …