Results 1 
8 of
8
Ordered Binary Decision Diagrams and the DavisPutnam Procedure
 IN PROC. OF THE 1ST INTERNATIONAL CONFERENCE ON CONSTRAINTS IN COMPUTATIONAL LOGICS
, 1994
"... We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior for ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions that share a common structure. The two methods illustrate the different and often complementary strengths of constraintoriented and searchoriented procedures.
Constraint logic programming  an informal introduction
 LOGIC PROGRAMMING IN ACTION, NUMBER 636 IN LNCS
, 1992
"... Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consi...
Negative Boolean Constraints
, 1994
"... Systems of Boolean constraints which allow negative constraints such as f 6` g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query deco ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Systems of Boolean constraints which allow negative constraints such as f 6` g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query decomposition, machine reasoning, and constraint logic programming. Proofs of the results rely on independence of inequations, which enables results for systems with a single inequation to be lifted to systems with many inequations. 1 Introduction Since Boole [2], systems (or conjunctions) of positive constraints f ` g over a Boolean algebra have been extensively studied. Here, we introduce and study a more general notion of Boolean constraint system in which negative Boolean constraints f 6` g are also allowed. Systems of positive and negative constraints have not yet been widely studied in their own right. This may be because in the case of twovalued Boolean algebras, negative constraints ad...
A Problem Classification Scheme for Finite Domain Constraint Solving
 PROCEEDING OF WORKSHOP ON CONSTRAINT APPLICATIONS, CP96,BOSTON
, 1996
"... In this paper we give a classification of problems solved with finite domain solvers in Constraint Logic Programming (CLP). This scheme tries to explain which types of problems can effectively be solved with CLP and which problems are best solved with competing techniques like integer programming or ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
In this paper we give a classification of problems solved with finite domain solvers in Constraint Logic Programming (CLP). This scheme tries to explain which types of problems can effectively be solved with CLP and which problems are best solved with competing techniques like integer programming or local search. The survey is based on industrial studies and applications developed over the last ten years. We also try to find explanations for failures in some projects and give a list of critical issues in problem solving with constraint logic programming.
Generalised Constraint Propagation Over the CLP Scheme
 Journal of Logic Programming
, 1992
"... Constraint logic programming is often described as logic programming with unification replaced by constraint solving over a computation domain. There is another, very different, CLP paradigm based on constraint satisfaction, where programdefined goals can be treated as constraints and handled using ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Constraint logic programming is often described as logic programming with unification replaced by constraint solving over a computation domain. There is another, very different, CLP paradigm based on constraint satisfaction, where programdefined goals can be treated as constraints and handled using propagation. This paper proposes a generalisation of propagation, which enables it to be applied on arbitrary computation domains, revealing that the two paradigms of CLP are orthogonal, and can be freely combined. The main idea behind generalised propagation is to use whatever constraints are available over the computation domain to express restrictions on problem variables. Generalised propagation on a goal G requires that the system extracts a constraint approximating all the answers to G. The paper introduces a generic algorithm for generalised propagation called topological branch and bound which avoids enumerating all the answers to G. Generalised propagation over the Herbrand univers...
Constraint Logic Programming
"... In this tutorial we give an overview of constraint logic programming (CLP), a combination of two declarative programming paradigms, logic programming and constraint solving. We present an informal introduction to different constraint solving methods used in CLP systems, with the emphasis on finite d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this tutorial we give an overview of constraint logic programming (CLP), a combination of two declarative programming paradigms, logic programming and constraint solving. We present an informal introduction to different constraint solving methods used in CLP systems, with the emphasis on finite domain constraints. In addition we look at different ways to express heuristics as part of CLP programs and discuss problem solving methodology. We also give an overview of different CLP systems currently available and present some of their application domains, with special emphasis on industrial applications for production planning, scheduling and resource allocation.
Integrating Propagation and Builtin Constraints
, 1992
"... Constraint logic programming is often described as logic programming with unification replaced by constraint solving over a computation domain. There is another, very different, CLP paradigm based on constraint satisfaction, where programdefined goals can be treated as constraints and handled using ..."
Abstract
 Add to MetaCart
Constraint logic programming is often described as logic programming with unification replaced by constraint solving over a computation domain. There is another, very different, CLP paradigm based on constraint satisfaction, where programdefined goals can be treated as constraints and handled using propagation. This paper proposes a generalisation of propagation, which enables it to be applied on arbitrary computation domains, thereby restoring orthogonality and bridging the gap between two important constraint logic programming paradigms. The main idea behind generalised propagation is to use whatever constraints are available over the computation domain to express restrictions on problem variables. Generalised propagation on a goal G requires that the system extracts a constraint approximating all the answers to G. The paper introduces a generic algorithm for generalised propagation called "topological branch and bound" which avoids enumerating all the answers to G. Generalised prop...