700 search results - page 91 / 140 » On Termination of Constraint Logic Programs |
IOR
2007
14 years 11 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
135
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
DEXA
2000
Springer
15 years 3 months ago
2000
Springer
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a rule-based system (RBS). A semantic inconsistency is defined by...
134
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
91
Voted
CL
2000
Springer
15 years 3 months ago
2000
Springer
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...