Performance of a resource-efficient provisioning framework (RPF) is evaluated in this paper in wavelengthcontinuous optical networks under static traffic. The structure of the survivable routing problem is unraveled by an integer linear programming (ILP) model. Numerical results from direct ILP approaches show that the RPF still achieves more than 10% capacity savings over the traditional provi...

Most Inductive Logic Programming (ILP) systems use a greedy covering algorithm to nd a set of clauses that best model positive examples. This set of clauses is called a theory and can be seen as an ensemble of clauses. It turns out that the search for a theory within the ILP system is very time consuming and often yields overly complex classi ers. One alternative approach to obtain a theory is ...

In this work we introduce a new hard problem in lattices called Isometric Lattice Problem (ILP) and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this problem. We also show that this problem has an (efficient prover) perfect zero-knowledge interactive proof; this is the only hard problem in lattices that is known to have this property (with respect to malicious verif...

The handling of exceptions in multiclass problems is a tricky issue in inductive logic programming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one c...

Increasing the productivity of simulation-based semiconductor design verification is one of the urgent challenges identified in the International Technology Roadmap for Semiconductors. The most difficult aspect is the generation of stimulus for functional coverage closure. This paper introduces a new CoverageDirected test Generation (CDG) feedback loop which applies Inductive Logic Programming ...

In this paper we investigate the efficiency of – subsumption (` ), the basic provability relation in ILP. As D ` C is NP–complete even if we restrict ourselves to linked Horn clauses and fix C to contain only a small constant number of literals, we investigate in several restrictions of D. We first adapt the notion of determinate clauses used in ILP and show that –subsumption is decidable in po...

It is recognized that efficiency and scalability is a major obstacle to an increased usage of Inductive Logic Programming (ILP) in complex applications with large hypotheses spaces. In this work, we focus on improving the efficiency and scalability of ILP systems by exploring tabling mechanisms available in the underlying Logic Programming systems. We present two different approaches. Our first...

In this paper, we propose a bigram based supervised method for extractive document summarization in the integer linear programming (ILP) framework. For each bigram, a regression model is used to estimate its frequency in the reference summary. The regression model uses a variety of indicative features and is trained discriminatively to minimize the distance between the estimated and the ground ...

We study the problem of traffic grooming in wavelength-division-multiplexing (WDM) rings with dynamic traffic. We consider both unidirectional and bi-directional rings. In our dynamic traffic model, traffic is represented by a set of different traffic requirements that the network needs to satisfy, but at different times. Our objective is to minimize the required number of electronic add/drop m...

When dealing with the classiication problems, current ILP systems often lag behind state-of-the-art attributional learners. Part of the blame can be ascribed to a much larger hypothesis space which, therefore, cannot be as thoroughly explored. However, sometimes it is due to the fact that ILP systems do not take into account the probabilistic aspects of hypotheses when classifying unseen exampl...