Results 1  10
of
1,575,577
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Prosodic Morphology: constraint interaction and satisfaction
, 1993
"... Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments......................................................... ..."
Abstract

Cited by 420 (31 self)
 Add to MetaCart
Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments.........................................................
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
ConstraintSatisfaction Inference for Entity Recognition
"... Abstract One approach to QA answering is to match a question to candidate answers in a background corpus based on semantic overlap, possibly in combination with other levels of matching, such as lexical vector space similarity and syntactic similarity. While the computation of deep semantic similari ..."
Abstract
 Add to MetaCart
. This problem, like many others in Natural Language Processing, is a sequence labelling task. We describe the development of a new approach to sequence labelling in general, based on the constraint satisfaction inference. The output of the machinelearningbased classifiers that solve aspects of the task (such
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3712 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
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
Analogical Mapping by Constraint Satisfaction
 COGNITIVE SCIENCE 13, 295 (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 389 (28 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
ConstraintDirected Backtracking Algorithm for ConstraintSatisfaction Problems
, 1996
"... We propose a new backtracking method called constraintdirected backtracking (CDBT) for solving constraintsatisfaction problems (CSPs). CDBT and chronological backtracking (BT) share a similar style of instantiating variables (forward) and reinstantiating variables (backward). They differ in that ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose a new backtracking method called constraintdirected backtracking (CDBT) for solving constraintsatisfaction problems (CSPs). CDBT and chronological backtracking (BT) share a similar style of instantiating variables (forward) and reinstantiating variables (backward). They differ
Analyzing a Heuristic Strategy for ConstraintSatisfaction and Scheduling
 in Intelligent Scheduling
, 1994
"... This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a valueordering ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained 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
Results 1  10
of
1,575,577