this paper is to suggest, by analysis and by example, how we are now in a much improved position to overcome this deadlock. The first part of this paper (sections 1--3) explores combinatorial extensions to th
We argue for the benefits of relations over functions for modelling programs, and even more so for m...
Combinatorial optimization problems require selecting the best solution from a discrete (albeit ofte...
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable ...
Algebraic modeling languages have become a standard tool in the development of linear and nonlinear ...
. This paper proposes a logic-based approach to optimization that combines solution methods from ma...
Constraint logic programming has become a promising new technology for solving complex combinatorial...
A difficult class of problems is the class of combinatorial optimization problems. This is because ...
A logic view of 0-1 integer programming problems, providing new insights into the structure of probl...
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and oper...
Constraint logic programming (CLP) has become a promising new technology for solving complex combina...
Linear programming and constraint propagation are complementary techniques with the potential for in...
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable ...
This paper considers a programming language where all control is encoded in algebras and combinators...
Linear programming and constraint propagation are comple-mentary techniques with the potential for i...
Many logic programming based approaches can be used to describe and solve combinatorial search probl...
We argue for the benefits of relations over functions for modelling programs, and even more so for m...
Combinatorial optimization problems require selecting the best solution from a discrete (albeit ofte...
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable ...
Algebraic modeling languages have become a standard tool in the development of linear and nonlinear ...
. This paper proposes a logic-based approach to optimization that combines solution methods from ma...
Constraint logic programming has become a promising new technology for solving complex combinatorial...
A difficult class of problems is the class of combinatorial optimization problems. This is because ...
A logic view of 0-1 integer programming problems, providing new insights into the structure of probl...
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and oper...
Constraint logic programming (CLP) has become a promising new technology for solving complex combina...
Linear programming and constraint propagation are complementary techniques with the potential for in...
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable ...
This paper considers a programming language where all control is encoded in algebras and combinators...
Linear programming and constraint propagation are comple-mentary techniques with the potential for i...
Many logic programming based approaches can be used to describe and solve combinatorial search probl...
We argue for the benefits of relations over functions for modelling programs, and even more so for m...
Combinatorial optimization problems require selecting the best solution from a discrete (albeit ofte...
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable ...
DOI
Add to ORKG