1097 search results - page 135 / 220 » Revision Programming = Logic Programming Integrity Constra... |
121
click to vote
CL
2000
Springer
15 years 7 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...
158
Voted
PLANX
2007
15 years 4 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
130
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
149
click to vote
AGP
1999
IEEE
15 years 7 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
127
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...