Sciweavers

1421 search results - page 22 / 285
» Satisfying KBO Constraints
Sort
View
CP
2006
Springer
13 years 11 months ago
Watched Literals for Constraint Propagation in Minion
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide...
Ian P. Gent, Christopher Jefferson, Ian Miguel
ACL
2009
13 years 5 months ago
A Syntax-Driven Bracketing Model for Phrase-Based Translation
Syntactic analysis influences the way in which the source sentence is translated. Previous efforts add syntactic constraints to phrase-based translation by directly rewarding/puni...
Deyi Xiong, Min Zhang, AiTi Aw, Haizhou Li
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 6 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
ENTCS
2008
110views more  ENTCS 2008»
13 years 8 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio