• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,630
Next 10 →

Global Constraints

by Jean-charles Régin
"... For use only by the students of the CP 2005 Summer School. Abstract. Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently use ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
For use only by the students of the CP 2005 Summer School. Abstract. Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently

Global Constraints

by Willem-Jan van Hoeve, Irit Katriel , 2006
"... ..."
Abstract - Cited by 34 (6 self) - Add to MetaCart
Abstract not found

On the Reification of Global Constraints

by Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson - CONSTRAINTS
"... We introduce a simple idea for deriving reified global constraints in a systematic way. It is based on the observation that most global constraints can be reformulated as a conjunction of total function constraints together with a constraint that can be easily reified. ..."
Abstract - Cited by 72 (6 self) - Add to MetaCart
We introduce a simple idea for deriving reified global constraints in a systematic way. It is based on the observation that most global constraints can be reformulated as a conjunction of total function constraints together with a constraint that can be easily reified.

Global Constraints for Lexicographic Orderings

by Alan Frisch, Brahim Hnich, Zeynep Kızıltan, Ian Miguel, Toby Walsh , 2002
"... We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show ..."
Abstract - Cited by 83 (35 self) - Add to MetaCart
We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show

The Complexity of Global Constraints

by Christian Bessiere, et al. , 2004
"... We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the same tools of computational complexity can be used in the design and analysis of specific global constraints. In particular, ..."
Abstract - Cited by 82 (23 self) - Add to MetaCart
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the same tools of computational complexity can be used in the design and analysis of specific global constraints. In particular

Introducing Global Constraints in CHIP

by Nicolas Beldiceanu, Evelyne Contejean , 1994
"... The purpose of this paper is to show how the introduction of new primitive constraints (e.g. among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding very rapidly good solutions for a large class of difficult sequencing, scheduling, geometrical place ..."
Abstract - Cited by 107 (18 self) - Add to MetaCart
globally a set of elementary constraints. Finally, we point out that all the previous primitive constraints enhance the power of the CHIP system significantly, allowing to solve real life problems that were not within reach of constraint technology before. 1

GLOBAL CONSTRAINTS AND FILTERING ALGORITHMS

by Jean-Charles Régin
"... Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algor ..."
Abstract - Cited by 22 (1 self) - Add to MetaCart
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering

Global constraints: A survey

by Jean-Charles Régin - IN , 2011
"... Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP because they exploit the specific structure of each constraint. This chapter is an overview of these two techniques. A collection of the most frequently u ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP because they exploit the specific structure of each constraint. This chapter is an overview of these two techniques. A collection of the most frequently

Reifying Global Constraints

by François Fages, Sylvain Soliman , 2012
"... Global constraints were introduced two decades ago as a means to model some core aspects of combinatorial problems with one single constraint for which an efficient domain filtering algorithm can be provided, possibly using a complete change of representation. However, global constraints are just c ..."
Abstract - Add to MetaCart
Global constraints were introduced two decades ago as a means to model some core aspects of combinatorial problems with one single constraint for which an efficient domain filtering algorithm can be provided, possibly using a complete change of representation. However, global constraints are just

Global Constraints with Fuzzy Extensions

by Harald Meyer Auf'm Hofe, Harald Meyer Auf'm Hofe , 2002
"... Undoubtedly, constraint-based reasoning owes a large portion of its success to the effort that has been spent on the development of global constraints. This paper enhances a state of the art formalization of soft constraints by a notion of global constraints. As a result, formalizations common to ..."
Abstract - Add to MetaCart
Undoubtedly, constraint-based reasoning owes a large portion of its success to the effort that has been spent on the development of global constraints. This paper enhances a state of the art formalization of soft constraints by a notion of global constraints. As a result, formalizations common
Next 10 →
Results 1 - 10 of 9,630
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University