700 search results - page 83 / 140 » On Termination of Constraint Logic Programs |
163
Voted
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
161
click to vote
RISE
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
148
Voted
CP
2004
Springer
15 years 11 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
162
click to vote
CLIMA
2007
15 years 7 months ago
2007
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...
175
click to vote
IJCAI
1993
15 years 7 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...