“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

The satis ability (SAT) problem is a core problem in mathematical logic and computing
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …

The scope of certain well-studied polynomial-time solvable classes of Satisfiability is
investigated relative to a polynomial-time solvable class consisting of what we call matched …

The structure of the monoid of autarkies and the monoid of autark subsets for clause-sets F
is investigated, where autarkies are partial (truth) assignments satisfying some subset F′⊆ …

Parameterized complexity is a new theoretical framework that considers, in addition to the
overall input size, the effects on computational complexity of a secondary measurement, the …

This chapter traces the links between the notion of Satisfiability and the attempts by
mathematicians, philosophers, engineers, and scientists over the last 2300 years to develop …

Conditional knowledge bases have been proposed as belief bases that include defeasible
rules (also called defaults) of the form “φ→ ψ”, which informally read as “generally, if φ then …

We present a formalism for reasoning about the information properties of multi-agent
systems. Multi-agent VSK logic allows us to represent what is objectively true of some …

Semidefinite optimization, commonly referred to as semidefinite programming, has been a
remarkably active area of research in optimization during the last decade. For combinatorial …