Sciweavers

CP
2005
Springer
14 years 4 months ago
Solving Simple Planning Problems with More Inference and No Search
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
CP
2005
Springer
14 years 4 months ago
Bounds-Consistent Local Search
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
CP
2005
Springer
14 years 4 months ago
Specialised Constraints for Stable Matching Problems
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
CP
2005
Springer
14 years 4 months ago
Encoding HTN Planning as a Dynamic CSP
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
CP
2005
Springer
14 years 4 months ago
Caching Search States in Permutation Problems
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
CP
2005
Springer
14 years 4 months ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
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
CP
2005
Springer
14 years 4 months ago
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
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
CP
2005
Springer
14 years 4 months ago
On Solving Soft Temporal Constraints Using SAT Techniques
In this paper, we present an algorithm for finding 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...
CP
2005
Springer
14 years 4 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...