Results 1 
6 of
6
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 866 (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.
Ordering Constraints over Feature Trees
, 1999
"... Feature trees are the formal basis for algorithms manipulating record like structures in constraint programming, computational linguistics and in concrete applications like software configuration management. Feature trees model records, and constraints over feature trees yield extensible and modular ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
(Show Context)
Feature trees are the formal basis for algorithms manipulating record like structures in constraint programming, computational linguistics and in concrete applications like software configuration management. Feature trees model records, and constraints over feature trees yield extensible and modular record descriptions. We introduce the constraint system FT of ordering constraints interpreted over feature trees. Under the view that feature trees represent symbolic information, the relation corresponds to the information ordering ("carries less information than"). We present two algorithms in cubic time, one for the satisfiability problem and one for the entailment problem of FT . We show that FT has the independence property. We are thus able to handle negative conjuncts via entailment and obtain a cubic algorithm that decides the satisfiability of conjunctions of positive and negated ordering constraints over feature trees. Furthermore, we reduce the satisfiability problem of Dorre's weak subsumption constraints to the satisfiability problem of FT and improve the complexity bound for solving weak subsumption constraints from O(n^5) to O(n³).
The Independence Property of a Class of Set Constraints
 In Conference on Principles and Practice of Constraint Programming
, 1996
"... We investigate a class of set constraints that is used for the type analysis of concurrent constraint programs. Its constraints are inclusions between firstorder terms (without set operators) interpreted over nonempty sets of finite trees. We show that this class has the independence property. We ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
(Show Context)
We investigate a class of set constraints that is used for the type analysis of concurrent constraint programs. Its constraints are inclusions between firstorder terms (without set operators) interpreted over nonempty sets of finite trees. We show that this class has the independence property. We give a polynomial algorithm for entailment. The independence property is a fundamental property of constraint systems. It says that the constraints cannot express disjunctions, or, equivalently, that negated conjuncts are independent from each other. As a consequence, the satisfiability of constraints with negated conjuncts can be directly reduced to entailment. 1 Introduction In this paper we show that a class of set constraints that is used for the type analysis of concurrent constraint programs has the independence property and give a polynomial entailment algorithm for this class. Below we introduce the property and the class, and then we are able to state the results more precisely. I...
DF Constraint System
 In Proceeding of the First International Workshop on Concurrent Constraint Programming, Ph. Codognet
, 1995
"... This work presents DF, a feature constraint system that starting from the main lines of the two major approaches in the field  the OSF system of Hassan AitKaci, and the CFT system of Gert Smolka  provides for new significant characteristics: a firstclass citizen status offered to (both fea ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This work presents DF, a feature constraint system that starting from the main lines of the two major approaches in the field  the OSF system of Hassan AitKaci, and the CFT system of Gert Smolka  provides for new significant characteristics: a firstclass citizen status offered to (both features and) sorts, finer grained constraints using arguments in the feature context, welltype conditioning between feature values and types, and principlebased completion of sort signature.
Constraint Based Reasoning with Constraint Logic Programming and Array Based Logic
, 1996
"... The paper describes how Constraint Based Reasoning (CBR) can be performed with two different paradigms, Constraint Logic Programming (CLP) and Array Based Logic (ABL). The author describes the operation of Constraint Logic Programming emphasizing CLP techniques for finite domain problems such as sea ..."
Abstract
 Add to MetaCart
(Show Context)
The paper describes how Constraint Based Reasoning (CBR) can be performed with two different paradigms, Constraint Logic Programming (CLP) and Array Based Logic (ABL). The author describes the operation of Constraint Logic Programming emphasizing CLP techniques for finite domain problems such as search strategies and consistency techniques. An explanation of Array Based Logic is presented including a description of methods for creating, joining and compressing ABL relations as well as an heuristic for building a system of relations in ABL. A familiar cryptogram is used as an example to demonstrate the operation of the two approaches for finite domain constraint problems. Some potential avenues of research are also presented. 1 Introduction In recent years, there has been a substantial increase in interest in Constraint Based Reasoning (CBR) among computer scientists and engineers. The great potential of CBR as a problem solving tool is becoming increasingly apparent. Known areas of ...