Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Journal of Logic Programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Heuristic search in restricted memory (research note)
Artificial Intelligence
Introduction to algorithms
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Artificial Intelligence
A general best first search algorithm in AND/OR graphs
Journal of Algorithms
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
Linear-space best-first search
Artificial Intelligence
Semantics of constraint logic programs with optimization
ACM Letters on Programming Languages and Systems (LOPLAS)
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Encapsulated search for higher-order concurrent constraint programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Towards an adequate theorem prover based on the connection method
AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
The OPL optimization programming language
The OPL optimization programming language
Constraint Programming: Strategic Directions
Constraints
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
On the Semantics of Optimization Predicates in CLP Languages
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Constructive Negation by Pruning and Optimizing Higher-Order Predicates for CLP and CC Languages
Selected Papers from Constraint Programming: Basics and Trends
A scheme for unifying optimization and constraint satisfaction methods
The Knowledge Engineering Review
Numerica: a modeling language for global optimization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Semiring-based constraint logic programming
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation
IEEE Transactions on Knowledge and Data Engineering
Developing a labelled object-relational constraint database architecture for the projection operator
Data & Knowledge Engineering
Hi-index | 0.00 |
This paper presents a framework for efficiently solving logic formulations of combinatorial optimization problems using heuristic search techniques. In order to integrate cost, lower bound and upper bound specifications with conventional logic programming languages, we augment a CLP language with embedded constructs for specifying the cost function and with a few higher order predicates for specifying the lower and upper bound functions. We illustrate how this simple extension vastly enhances the ease with which optimization problems involving combinations of Min and Max can be specified in the extended language CLP* and show that CSLDNF resolution schemes are not efficient for solving optimization problems specified in this language. Therefore, we describe how any problem specified using CLP* can be converted into an implicit AND/OR graph, and present an algorithm GenSolve which can branch and bound using upper and lower bound estimates, thus exploiting the full pruning power of heuristic search techniques. A technical analysis of GenSolve is provided. We also provide experimental results comparing various control strategies for solving CLP* programs.