Results 1  10
of
41,059
Disjunction of NonBinary and Numeric Constraint Satisfaction Problems
"... Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Many CSPs can be modelled as nonbinary CSPs and, theoretically, they can be transformed into an equivalent binary CSP, using some of the current techniques. However, this transformation may be an inadequate or ine#ci ..."
Abstract
 Add to MetaCart
Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Many CSPs can be modelled as nonbinary CSPs and, theoretically, they can be transformed into an equivalent binary CSP, using some of the current techniques. However, this transformation may be an inadequate or ine
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.........................................................
Representation and Reasoning with NonBinary Constraints
, 2001
"... Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important in constrai ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Many problems from the \real world" can be eciently expressed as constraint satisfaction problems (CSPs). Most of these can be naturally modelled using nary (or nonbinary) constraints. Representing problems with nary constraints and reasoning with them is therefore very important
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
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers  both traditional and non standard ones  written in the CHR language. Finally we
On NonBinary Temporal Relations
, 1998
"... I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other nonbina ..."
Abstract
 Add to MetaCart
I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other nonbinary
A NONBINARY CONSTRAINT ORDERING HEURISTIC FOR CONSTRAINT SATISFACTION PROBLEMS
"... Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of con ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with nonbinary constraints. In this paper, we present a preprocess heuristic called Constraint Ordering Heuristic (COH) that studies the constrainedness of the scheduling problem
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
Semantic Similarity in a Taxonomy: An InformationBased Measure and its Application to Problems of Ambiguity in Natural Language
, 1999
"... This article presents a measure of semantic similarityinanisa taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edgecounting approach. The a ..."
Abstract

Cited by 601 (9 self)
 Add to MetaCart
. The article presents algorithms that take advantage of taxonomic similarity in resolving syntactic and semantic ambiguity, along with experimental results demonstrating their e#ectiveness. 1. Introduction Evaluating semantic relatedness using network representations is a problem with a long history
Results 1  10
of
41,059