Results 1  10
of
11,465
The Constraint Language for Lambda Structures
, 2000
"... This paper presents the Constraint Language for Lambda Structures (CLLS), a firstorder language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, treelike structures that encode terms. Based on CLLS, we present an underspe ..."
Abstract

Cited by 97 (34 self)
 Add to MetaCart
This paper presents the Constraint Language for Lambda Structures (CLLS), a firstorder language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, treelike structures that encode terms. Based on CLLS, we present
The Complexity Of Maximal Constraint Languages
, 2001
"... Many combinatorial search problems can be expressed as "constraint satisfaction problems" using an appropriate "constraint language", that is, a set of relations over some fixed finite set of values. It is wellknown that there is a tradeoff between the expressive power of a con ..."
Abstract

Cited by 38 (9 self)
 Add to MetaCart
Many combinatorial search problems can be expressed as "constraint satisfaction problems" using an appropriate "constraint language", that is, a set of relations over some fixed finite set of values. It is wellknown that there is a tradeoff between the expressive power of a
Definite Relations over Constraint Languages
 LILOG Report 53, IWBS, IBM Deutschland, Postfach 80 08 80, 7000 Stuttgart 80
, 1988
"... This paper shows that the nice properties of logic programs extend to definite clause specifications over arbitrary constraint languages. The notion of a constraint language sees a constraint as a piece of syntax with unknown internal structure that constrains the values variables can take in interp ..."
Abstract

Cited by 88 (5 self)
 Add to MetaCart
This paper shows that the nice properties of logic programs extend to definite clause specifications over arbitrary constraint languages. The notion of a constraint language sees a constraint as a piece of syntax with unknown internal structure that constrains the values variables can take
The complexity of equality constraint languages
 CORNELL UNIVERSITY
, 2006
"... We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint satisfaction problems with templates that have a highly transitive automorphism group. A relational structure has such an automorphism group if and only if all the c ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
the constraint types are Boolean combinations of the equality relation, and we call the corresponding constraint languages equality constraint languages. We show that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism, and is NPcomplete otherwise.
Reflections on the Object Constraint Language
 In The Unified Modeling Language (UML), LNCS
, 1998
"... . The object Constraint Language (OCL), which forms part of the UML set of modelling notations, is a precise, textual language for expressing constraints that cannot be shown diagrammatically in UML. This paper reflects on a number of aspects of the syntax and semantics of the OCL, and makes pro ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
. The object Constraint Language (OCL), which forms part of the UML set of modelling notations, is a precise, textual language for expressing constraints that cannot be shown diagrammatically in UML. This paper reflects on a number of aspects of the syntax and semantics of the OCL, and makes
The Complexity of Equality Constraint Languages
"... Abstract. We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint languages where the constraint types are Boolean combinations of the equality relation. We show that such a constraint language is tractable if it admits a ..."
Abstract
 Add to MetaCart
Abstract. We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint languages where the constraint types are Boolean combinations of the equality relation. We show that such a constraint language is tractable if it admits a
The Complexity of Temporal Constraint Languages
"... A temporal constraint language is a set of relations that has a firstorder definition in (Q, <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint langu ..."
Abstract
 Add to MetaCart
A temporal constraint language is a set of relations that has a firstorder definition in (Q, <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the con
Businessoriented Constraint Language
"... Abstract. The Businessoriented Constraint Language (BCL) is proposed as a means of annotating diagrams in UML. BCL is grounded in the Object Constraint Language (OCL) but is designed particularly to address the needs of people who are concerned with enterprise application integration (EAI), althoug ..."
Abstract
 Add to MetaCart
Abstract. The Businessoriented Constraint Language (BCL) is proposed as a means of annotating diagrams in UML. BCL is grounded in the Object Constraint Language (OCL) but is designed particularly to address the needs of people who are concerned with enterprise application integration (EAI
Results 1  10
of
11,465