1144 search results - page 100 / 229 » Logic programming for combinatorial problems |
105
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
121
Voted
JCO
2000
15 years 2 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
126
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
135
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
141
click to vote
FUIN
2010
14 years 12 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...