Results 1  10
of
43
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications.
Algorithms for ConstraintSatisfaction Problems: A Survey
, 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraintsatisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract

Cited by 447 (0 self)
 Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraintsatisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, and the satisfiability problem. A number of different approaches have been developed for solving these problems. Some of them use constraint propagation to simplify the original problem. Others use backtracking to directly search for possible solutions. Some are a combination of these two techniques. This article overviews many of these approaches in a tutorial fashion.
Improvements To Propositional Satisfiability Search Algorithms
, 1995
"... ... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400variable 3SAT problems in about 2 hours on the average. In general, it can solve hard nvariable ..."
Abstract

Cited by 174 (0 self)
 Add to MetaCart
... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400variable 3SAT problems in about 2 hours on the average. In general, it can solve hard nvariable random 3SAT problems with search trees of size O(2 n=18:7 ). In addition to justifying these claims, this dissertation describes the most significant achievements of other researchers in this area, and discusses all of the widely known general techniques for speeding up SAT search algorithms. It should be useful to anyone interested in NPcomplete problems or combinatorial optimization in general, and it should be particularly useful to researchers in either Artificial Intelligence or Operations Research.
Algorithms for the Satisfiability (SAT) Problem: A Survey
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1996
"... . 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, computeraided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, compute ..."
Abstract

Cited by 144 (3 self)
 Add to MetaCart
(Show Context)
. 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, computeraided 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...
Truth Maintenance
, 1990
"... General purpose truth maintenance systems have received considerable attention in the past few years. This paper discusses the functionality of truth maintenance systems and compares various existing algorithms. Applications and directions for future research are also discussed. Introduction In 197 ..."
Abstract

Cited by 136 (3 self)
 Add to MetaCart
General purpose truth maintenance systems have received considerable attention in the past few years. This paper discusses the functionality of truth maintenance systems and compares various existing algorithms. Applications and directions for future research are also discussed. Introduction In 1978 Jon Doyle wrote a masters thesis at the MIT AI Laboratory entitled "Truth Maintenance Systems for Problem Solving" [ Doyle, 1979 ] . In this thesis Doyle described an independent module called a truth maintenance system, or TMS, which maintained beliefs for general problem solving systems. In the twelve years since the appearance of Doyle's TMS a large body of literature has accumulated on truth maintenance. The seminal idea appears not to have been any particular technical mechanism but rather the general concept of an independent module for truth (or belief) maintenance. All truth maintenance systems manipulate proposition symbols and relationships between proposition symbols. I will use...
A Fast PseudoBoolean Constraint Solver
, 2003
"... Linear PseudoBoolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the modeling power of purely propositional constraints. They can be used to compactly describe many discrete EDA problems with constraints on linea ..."
Abstract

Cited by 115 (1 self)
 Add to MetaCart
(Show Context)
Linear PseudoBoolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the modeling power of purely propositional constraints. They can be used to compactly describe many discrete EDA problems with constraints on linearly combined, parameterized weights, yet also offer efficient search strategies for proving or disproving whether a satisfying solution exists. Furthermore, corresponding decision procedures can easily be extended for minimizing or maximizing an LPB objective function, thus providing a core optimization method for many problems in logic and physical synthesis. In this paper we review how recent advances in satisfiability (SAT) search can be extended for pseudoBoolean constraints and describe a new LPB solver that is based on generalized constraint propagation and conflictbased learning. We present a comparison with other, stateoftheart LPB solvers which demonstrates the overall efficiency of our method.
Maintaining ArcConsistency within Dynamic Backtracking
 IN PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING (CP 2000), NUMBER 1894 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2000
"... Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main ..."
Abstract

Cited by 66 (16 self)
 Add to MetaCart
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main
Inference methods for a pseudoBoolean satisfiability solver
, 2002
"... We describe two methods of doing inference during search for a pseudoBoolean version of the RELSAT method. One inference method is the pseudoBoolean equivalent of learning. ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
(Show Context)
We describe two methods of doing inference during search for a pseudoBoolean version of the RELSAT method. One inference method is the pseudoBoolean equivalent of learning.
CLP(R) and Some Electrical Engineering Problems
 Journal of Automated Reasoning
, 1991
"... The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constrain ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
(Show Context)
The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP(R) language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and nonnumeric computation. In this paper we illustrate the practical applicability of CLP(R) with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(R). A detailed look at some of the more important programming techniques highlights the ability of CLP(R) to support wellknown, powerful techniques from constraint programming. Our thesis is that CLP(R) is an embodiment of these techniques in a langu...
Approximating Minimal Unsatisfiable Subformulae by Means of Adaptive Core Search
 Discrete Applied Mathematics
, 2002
"... The paper is concerned with the relevant practical problem of selecting a small unsatisfiable subset of clauses inside an unsatisfiable CNF formula. Moreover, it deals with the algorithmic problem of improving an enumerative (DPLLstyle) approach to SAT, in order to overcome some structural defects ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
(Show Context)
The paper is concerned with the relevant practical problem of selecting a small unsatisfiable subset of clauses inside an unsatisfiable CNF formula. Moreover, it deals with the algorithmic problem of improving an enumerative (DPLLstyle) approach to SAT, in order to overcome some structural defects of such approach. Within a complete solution framework, we are able to evaluate the di#culty of each clause, by analyzing the history of the search. Such clause hardness evaluation is used in order to rapidly select an unsatisfiable subformula (of the given CNF) which is a good approximation of a minimal unsatisfiable subformula (MUS). Unsatisfiability is proved by solving only such subformula. Very small unsatisfiable subformulae are detected inside famous Dimacs unsatisfiable problems and in real world problems. Comparison with the very e#cient solver SATO 3.2 used as a stateoftheart DPLL procedure (disabling learning of new clauses) shows the e#ectiveness of such enumeration guide.