From experimental design to cryptography, this comprehensive, easy-to-access reference
contains literally all the facts you need on combinatorial designs. It includes constructions of …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

We study the runtime distributions of backtrack procedures for propositional satisfiability and
constraint satisfaction. Such procedures often exhibit a large variability in performance. Our …

This article describes the methods for collecting automated solutions in intellectual systems.
This article features conclusive methods based on the forward and reverse chains, the …

We present a distributed/parallel prover for propositional satisfiability (SAT), called PSATO,
for networks of workstations. PSATO is based on the sequential SAT prover SATO, which is …

This paper provides a detailed description of the CNF part of the TPTP Problem Library for
automated theorem-proving systems. The library is available via the Internet and forms a …

Abstract Model generation can be regarded as a spe cial case of the Constraint Satisfaction
Problem (CSP). It has many applications in AI, com puter science and mathematics. In this …

This document describes the implementation and use of a Davis-Putnam procedure for the
propositional satis ability problem. It also describes code that takes statements in rstorder …

This book can mark the coming of age of automated theorem proving (ATP). The process to
maturity has been a continuum, as it is for humans, but this book serves to mark the …

The method proposed by Davis, Putnam, Logemann, and Loveland for propositional
reasoning, often referred to as the Davis–Putnam method, is one of the major practical …