Results 1 - 10 of 37,335

Connectionism, parallel constraint satisfaction processes, and Gestalt principles: (Re)introducing cognitive dynamics to social psychology

by Stephen J. Read, Eric J. Vanman, Lynn C. Miller - REVIEW OF PERSONALITY AND SOCIAL PSYCHOLOGY , 1997
"... We argue that recent work in connectionist modeling, in particular the parallel constraint satisfaction processes that are central to many of these models, has great importancefor understanding issues ofboth historical and current concernfor social psychologists. We first provide a brief description ..."
Abstract - Cited by 54 (7 self) - Add to MetaCart
We argue that recent work in connectionist modeling, in particular the parallel constraint satisfaction processes that are central to many of these models, has great importancefor understanding issues ofboth historical and current concernfor social psychologists. We first provide a brief

Evidence that Binding Principles Participate in a Constraint Satisfaction Process

by William Badecker, Kathleen Straub - In 7th CUNY Conference on Human Sentence Processing , 1994
"... Introduction There is a recurrent view that language processing takes place in a cascade, with grammatical principles acting as an automatic filter on what information is made available to semantic and pragmatic processing mechanisms. Alternatively, one may view grammatical principles and semantic ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
there are well known grammatical constraints on pronoun interpretation and because there are several experimental techniques which allow one to examine various aspects of the interpretive processes. Although the process of pronoun interpretation has received considerable attention in psycholinguistic research

Adaptive Constraint Satisfaction

by J. E. Borrett, E. P. K. Tsang, N. R. Walsh - WORKSHOP OF THE UK PLANNING AND SCHEDULING , 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract - Cited by 952 (43 self) - Add to MetaCart
Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm

Analogical Mapping by Constraint Satisfaction

by Keith J. Holyoak, Paul Thagard - COGNITIVE SCIENCE 13, 29-5 (1989) , 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract - Cited by 397 (29 self) - Add to MetaCart
the anology Is being used. The theory is implemented in a computer progrom called ACME (Analogical Constraint Mapping Engine), which represents constraints by means of a network of supporting and competing hypotheses regarding what elements to map. A coop erative algorithm for parallel constraint satisfaction

Partial Constraint Satisfaction

by Eugene C. Freuder, Richard J. Wallace , 1992
"... . A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying ..."
Abstract - Cited by 471 (21 self) - Add to MetaCart
. A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying

Processing Temporal Constraint Networks

by Eddie Schwalb, Rina Dechter
"... ..."
Abstract - Cited by 1145 (36 self) - Add to MetaCart
Abstract not found

The lexical nature of syntactic ambiguity resolution

by Maryellen C Macdonald, Neal J Pearlmutter, Mark S Seidenberg - Psychological Review , 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract - Cited by 557 (24 self) - Add to MetaCart
processing. The central processing mechmultiple levels simultaneously, including lexical, phonological, anism we invoke is the constraint satisfaction process that has morphological, syntactic, and text or discourse levels. At any been realized in interactive-activation models (e.g., Elman &

The Semantics Of Constraint Logic Programs

by Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey - JOURNAL OF LOGIC PROGRAMMING , 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract - Cited by 872 (14 self) - Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important

The geometry of algorithms with orthogonality constraints

by Alan Edelman, Tomás A. Arias, Steven T. Smith - SIAM J. MATRIX ANAL. APPL , 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract - Cited by 640 (1 self) - Add to MetaCart
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal

Algorithms for Constraint-Satisfaction Problems: A Survey

by Vipin Kumar , 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments
Results 1 - 10 of 37,335