. The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the sat...

Abstract not found

This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. On the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. The technique has also been used for scheduling the Hubble Space telescope. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective. 1 Introduction One of the most promising general approaches for solving combinatorial search problems is to generate an initial...

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research. 1.

Process engineering involves a search for new models of organising work. This synthesis task can become quite difficult and time-consuming as the amount of detail required and interactions between activities increases. Domain independent AI planning offers some promising techniques and representations to assist in this effort. One of the major impediments to transferring this technology to applied, real-world settings is the difficulty encountered in building the domain model which is used in the automated generation of these plans. Competence, as well as good tools, is necessary to carry out this task. A plan domain methodology should be available which provides structured organisational development activities. Users need to know what tasks they have to perform: for each step, information must be available about what input will be needed, and what output will be required, what is to be done and how it can be done well. This paper presents the Common Process Methodology (CPM) which aim...