Results 1  10
of
2,976,711
Directional Constraint Evaluation in Optimality Theory
 Proceedings of the 18th International Conference on Computational Linguistics (COLING 2000
, 2000
"... this paper gives liuguis[ic a.n(l cmntmt;[ t,iomfi motiv,trion fiw I'he t)rOlmsa.l. [3 thmmlizes t, lie hlc:t mtd shows l:}ml, coutposizg a hu't,sduc:er with u di'rccZioial constraint yTcld.5 u tm,,sd,uccr. Thus direcl,ional const, taint, s, lik l)ounded (mcs, kee l) ()T wil:hin the ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
this paper gives liuguis[ic a.n(l cmntmt;[ t,iomfi motiv,trion fiw I'he t)rOlmsa.l. [3 thmmlizes t, lie hlc:t mtd shows l:}ml, coutposizg a hu't,sduc:er with u di'rccZioial constraint yTcld.5 u tm,,sd,uccr. Thus direcl,ional const, taint, s, lik l)ounded (mcs, kee l) ()T wil
Directional constraint evaluation in Optimality Theory
 In Proc. of COLING
, 2005
"... Accurate, dependable location information enables new services to users and efficient message routing within a sensor network. Finegrained location data are often degraded by prevalent multipath and varying transmission channel characteristics. Successful positioning systems have used overconstrain ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
constrained sensor data to increase resilience to these problems and improve the accuracy of the location information produced. In this paper we evaluate a selection of commonly used algorithms for rangebased (lateration) measurement data. We consider their accuracy, dependability, and computational requirements
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
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
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
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
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
of multiheaded guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable
Optimality Theory
, 2000
"... Introduction Rene Kager's textbook is one of the first to cover Optimality Theory (OT), a declarative grammar framework that swiftly took over phonology after it was introduced by Prince, Smolensky, and McCarthy in 1993. OT reclaims traditional grammar's ability to express surface genera ..."
Abstract

Cited by 419 (2 self)
 Add to MetaCart
Introduction Rene Kager's textbook is one of the first to cover Optimality Theory (OT), a declarative grammar framework that swiftly took over phonology after it was introduced by Prince, Smolensky, and McCarthy in 1993. OT reclaims traditional grammar's ability to express surface
Learnability in Optimality Theory
, 1995
"... In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given gr ..."
Abstract

Cited by 528 (34 self)
 Add to MetaCart
In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given
New Directions in Cryptography
, 1976
"... Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper sug ..."
Abstract

Cited by 3499 (7 self)
 Add to MetaCart
suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Results 1  10
of
2,976,711