Results 231 to 240 of about 15,838 (263)

Fast parallel constraint satisfaction

Artificial Intelligence, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Tools for constraint satisfaction

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artifical intelligence, from planning to natural language understanding. Constraint satisfaction can be very difficult.
openaire   +1 more source

Neural networks for constraint satisfaction

Connection Science, 1993
Abstract Constraint satisfaction problems (CSPs) play a central role in the real world and in computer science. CSPs are in general NP-hard and a general deterministic polynomial time algorithm is not known. CSPs with finite domains for the variables (finite constraint satisfaction problems) are considered.
openaire   +1 more source

Compaction, Retraction, and Constraint Satisfaction

SIAM Journal on Computing, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Synthesis of Constraint Satisfaction and Constraint Solving

2003
This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspired some constraint programming languages, it has some weaknesses that leave it not directly applicable to the study of complex constraints (including so-called global constraints) in ...
openaire   +1 more source

Distributed constraint satisfaction with partially known constraints

Constraints, 2008
Distributed constraint satisfaction problems (DisCSPs) are composed of agents connected by constraints. The standard model for DisCSP search algorithms uses messages containing assignments of agents. It assumes that constraints are checked by one of the two agents involved in a binary constraint, hence the constraint is fully known to both agents. This
Ismel Brito, Amnon Meisels, Pedro Meseguer, Roie Zivan   +3 more
openaire   +3 more sources

Constraint Satisfaction

2002
Abstract In this chapter we will introduce the notion of a constraint satisfaction problem (CSP) (Montanari 1974; Dechter and Pearl 1988; Mackworth 1992; Ladkin and Maddux 1994). We will then investigate some of the properties of CSPs, and use the CSP abstraction to represent the frequency assignment problem (FAP) in several different ...
Dave Cohen, Peter Jeavons
openaire   +1 more source

Constraint satisfaction problems

ACM SIGLOG News, 2018
In this paper we briefly survey the history of the Dichotomy Conjecture for the Constraint Satisfaction problem, that was posed 25 years ago by Feder and Vardi. We outline some of the approaches to this conjecture, and then describe an algorithm that yields an answer to the conjecture.
openaire   +1 more source

SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS

International Journal on Artificial Intelligence Tools, 1994
Abundant literatures exist on consistency techniques for solving Constraint Satisfaction Problems (CSPs). These literatures, however, focused mainly on finding efficient general techniques to achieve network consistency and to solve CSPs. So far, many techniques have been reported, e.g., node consistency, arc consistency, path consistency, k ...
openaire   +1 more source

Constraint relaxation in distributed constraint satisfaction problems

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
The distributed constraint satisfaction problem (DCSP) formulation has recently been identified as a general framework for formalizing various distributed artifical intelligence problems. The author extends the DCSP formalization by introducing the notion of importance values of constraints.
openaire   +1 more source