Programming Languages

19

CP
2005
Springer

90views Artificial Intelligence» more CP 2005»

Robust Constraint Solving Using Multiple Heuristics

14 years 1 months ago

Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...

Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...

claim paper

Read More »

23

click to vote

CP
2005
Springer

96views Artificial Intelligence» more CP 2005»

Solving Simple Planning Problems with More Inference and No Search

14 years 1 months ago

Download www.ics.uci.edu

Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...

Vincent Vidal, Hector Geffner

claim paper

Read More »

19

click to vote

CP
2005
Springer

164views Artificial Intelligence» more CP 2005»

Bounds-Consistent Local Search

14 years 1 months ago

Download lia.deis.unibo.it

This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...

Stefania Verachi, Steven David Prestwich

claim paper

Read More »

14

click to vote

CP
2005
Springer

57views Artificial Intelligence» more CP 2005»

Specialised Constraints for Stable Matching Problems

14 years 1 months ago

Download lia.deis.unibo.it

Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...

Chris Unsworth, Patrick Prosser

claim paper

Read More »

22

click to vote

CP
2005
Springer

108views Artificial Intelligence» more CP 2005»

Encoding HTN Planning as a Dynamic CSP

14 years 1 months ago

Download lia.deis.unibo.it

Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...

Pavel Surynek, Roman Barták

claim paper

Read More »

21

click to vote

CP
2005
Springer

125views Artificial Intelligence» more CP 2005»

Caching Search States in Permutation Problems

14 years 1 months ago

Download www.comp.leeds.ac.uk

When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...

Barbara M. Smith

claim paper

Read More »

19

click to vote

CP
2005
Springer

101views Artificial Intelligence» more CP 2005»

Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

14 years 1 months ago

Download www.carstensinz.de

We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...

Carsten Sinz

claim paper

Read More »

21

click to vote

CP
2005
Springer

139views Artificial Intelligence» more CP 2005»

Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming

14 years 1 months ago

Download 87.230.22.228

The eplex library of the ECLi PSe Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming t...

Kish Shen, Joachim Schimpf

claim paper

Read More »

23

click to vote

CP
2005
Springer

118views Artificial Intelligence» more CP 2005»

On Solving Soft Temporal Constraints Using SAT Techniques

14 years 1 months ago

Download www.eecs.umich.edu

In this paper, we present an algorithm for ﬁnding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...

Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...

claim paper

Read More »

14

click to vote

CP
2005
Springer

110views Artificial Intelligence» more CP 2005»

Approximated Consistency for the Automatic Recording Problem

14 years 1 months ago