Results 1  10
of
801,055
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems
Backtracking in distributed constraint networks
 International Journal on Artificial Intelligence Tools
, 1998
"... The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speedup of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distri ..."
Abstract

Cited by 90 (15 self)
 Add to MetaCart
distributed search procedure operating in distributed constraint networks [6]. The extension is twofold. First the procedure is updated to face delayed information problems upcoming in heterogeneous systems. Second, the search is extended to simultaneously explore independent parts of a distributed search
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
Valued Constraint Networks
 IN PROCEEDINGS OF THE SIXTH CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
, 2000
"... One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several adhoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms of var ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several adhoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms
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
On Minimal Constraint Networks
, 2011
"... In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NPhard to de ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP
On Fuzzy Temporal Constraint Networks
 MATHWARE AND SOFT COMPUTING
, 1994
"... Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CS ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based
On the minimality and decomposability of constraint networks
 In Proc. of the 10th National Conf. on AI
, 1992
"... Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) nd a solution that satis es the constraints and (ii) nd the corresponding minimal network where ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) nd a solution that satis es the constraints and (ii) nd the corresponding minimal network where
Arc Consistency for General Constraint Networks: Preliminary Results
, 1997
"... Constraint networks are used more and more to solve combinatorial problems in reallife applications. Much activity is concentrated on improving the efficiency of finding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many research ..."
Abstract

Cited by 139 (16 self)
 Add to MetaCart
Constraint networks are used more and more to solve combinatorial problems in reallife applications. Much activity is concentrated on improving the efficiency of finding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many
Results 1  10
of
801,055