CP 2007 - PDF Preprint Papers

CP 2007 Principles and Practice of Constraint Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CP-2007 Paper

click to vote

CP
2007
Springer

173views Artificial Intelligence» more CP 2007»

MiniZinc: Towards a Standard CP Modelling Language

13 years 3 months ago

Download www.ps.uni-saarland.de

Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it diﬃcult for modellers to...

Nicholas Nethercote, Peter J. Stuckey, Ralph Becke...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	173	MiniZinc: Towards a Standard CP Modelling Language	claim
2	162	Min-Domain Ordering for Asynchronous Backtracking	claim
3	155	Breaking Value Symmetry	claim
4	145	Model-Driven Visualizations of Constraint-Based Local Search	claim
5	144	Constraint-Based Temporal Reasoning for E-Learning with LODE	claim
6	144	AND/OR Multi-valued Decision Diagrams for Constraint Optimization	claim
7	140	Scheduling Conditional Task Graphs	claim
8	135	Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT	claim
9	134	Boosting Probabilistic Choice Operators	claim
10	127	Bound-Consistent Deviation Constraint	claim
11	126	Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario	claim
12	124	An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search	claim
13	124	On Inconsistent Clause-Subsets for Max-SAT Solving	claim
14	123	Path Consistency by Dual Consistency	claim
15	122	GAC Via Unit Propagation	claim
16	120	Uncertainty in Bipolar Preference Problems	claim
17	120	Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance	claim
18	119	Encodings of the Sequence Constraint	claim
19	116	Constructive Interval Disjunction	claim
20	114	Constraint Symmetry for the Soft CSP	claim
21	113	Limitations of Restricted Branching in Clause Learning	claim
22	113	Solution Counting Algorithms for Constraint-Centered Search Heuristics	claim
23	112	: The Design and Analysis of an Algorithm Portfolio for SAT	claim
24	112	An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming	claim
25	112	Decomposing Global Grammar Constraints	claim
26	110	On Universal Restart Strategies for Backtracking Search	claim
27	107	Towards Robust CNF Encodings of Cardinality Constraints	claim
28	107	The Log-Support Encoding of CSP into SAT	claim
29	107	Tradeoffs in the Complexity of Backdoor Detection	claim
30	106	A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects	claim
31	106	Filtering for Subgraph Isomorphism	claim
32	104	Strong Controllability of Disjunctive Temporal Problems with Uncertainty	claim
33	104	Dynamic Management of Heuristics for Solving Structured CSPs	claim
34	104	Local Symmetry Breaking During Search in CSPs	claim
35	103	A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs	claim
36	103	A Compression Algorithm for Large Arity Extensional Constraints	claim
37	102	Scheduling for Cellular Manufacturing	claim
38	102	Breaking Symmetry of Interchangeable Variables and Values	claim
39	99	Solving the Salinity Control Problem in a Potable Water System	claim
40	99	Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure	claim
41	98	Reformulating CSPs for Scalability with Application to Geospatial Reasoning	claim
42	98	A Constraint Store Based on Multivalued Decision Diagrams	claim
43	97	Dealing with Incomplete Preferences in Soft Constraint Problems	claim
44	96	Propagation = Lazy Clause Generation	claim
45	95	Groupoids and Conditional Symmetry	claim
46	92	An LP-Based Heuristic for Optimal Planning	claim
47	88	A Case for Simple SAT Solvers	claim
48	84	Exploring Different Constraint-Based Modelings for Program Verification	claim
49	82	Solution Directed Backjumping for QCSP	claim
50	80	Advisors for Incremental Propagation	claim
51	72	The Expressive Power of Valued Constraints: Hierarchies and Collapses	claim
52	62	Hierarchical Hardness Models for SAT	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers