999 search results - page 37 / 200 » Constraints in Non-Boolean Contexts |
185
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
152
click to vote
CPAIOR
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
162
click to vote
ICLP
2005
Springer
16 years 3 days ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
167
click to vote
AMAST
2004
Springer
16 years 5 hour ago
2004
Springer
Abstract. Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory. An integrity guard is code execut...
173
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...