We report results from large-scale experiments in satisfiability testing. As has been observed
by others, testing the satisfiability of random formulas often appears surprisingly easy. Here …

Abduction is an important form of nonmonotonic reasoning allowing one to find explanations
for certain symptoms or manifestations. When the application domain is described by a …

We present a unified framework for designing polynomial time approximation
schemes(PTASS) for “dense” instances of many NP-hard optimization problems, including …

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 …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

Finding sets of hard instances of propositional satis ability is of interest for understanding the
complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we …

Consider a salesperson that must sell some quota of brushes in order to win a trip to Hawaii.
This salesperson has a map (a weighted graph) in which each city has an attached demand …

Local search is widely used for solving the propositional satisfiability problem. Papadimitriou
(1991) showed that randomized local search solves 2-SAT in polynomial time. Recently …

Abduction—from observations and a theory, find using hypotheses an explanation for the
observations—gained increasing interest during the last years. This form of reasoning has …

GSAT is a randomized local search procedure for solving propositional satisfiability
problems. GSAT can solve hard, randomly generated problems that are an order of …