POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Constraint reasoning based on interval arithmetic: the tolerance propagation approach
Artificial Intelligence - Special volume on constraint-based reasoning
Towards practical interval constraint solving in logic programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Artificial Intelligence: Structures and Strategies for Complex Problem Solving
Artificial Intelligence: Structures and Strategies for Complex Problem Solving
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
An Informal Introduction to Constraint Database Systems
CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
Using Constraint Logic Programming in Memory Synthesis for General Purpose Computers
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Interface Timing Verification with Delay Correlation Using Constraint Logic Programming
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Operations Research: An Introduction (8th Edition)
Operations Research: An Introduction (8th Edition)
| Hi-index | 0.00 |
This paper presents a system for solving mixed infinite and finite domains linear problem using a Constraint Logic Programming (CLP) Environment. The contributions of our system are introduced in two directions. Firstly, unlike existing systems, the splitting of a variable's domain is based on the right hand side value of the first constraint in which it is involved rather than the splitting over an arbitrary value. Also, the splitting process is automatically performed by the system, when needed, rather than being the user's responsibility. Secondly, a relatively transparent integration is met between two Constraint Logic Programming solvers. The former is a Partial Look Ahead solver over rationals as well as integers with the support of the aforementioned domain splitting mechanism, while the latter is a Simplex-Like solver named CLP(Q). Each counterpart submits some services to the other in order that the coherent system improves the search efficiency and tackles their individual main defects.