In this paper we describe a new approach to rewrite rule extraction and analysis, using Minimal Representation Graphs. This approach provides a mechanism for obtaining the smallest possible rule set – within a context-dependent rewrite rule formalism – that describes a set of discrete training data completely, as an indirect approach to obtaining optimal accuracy on an unseen test set. We demon...

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling the false alarm rate associated with anomalous samples. By incorporating a non-...

The paper is concerned with the time complexity of model-based diagnosis. Our experiments indicate that the time to compute minimal diagnoses is dominated by the calls to the model of the device being diagnosed. In the paper we describe an attempt to reduce the number of model calls by incorporating two critical set algorithms Loveland, 1987] into IDA Mozeti c, 1992]. A critical set algorithm c...

Let L be a recursive algebraic extension of Q. Assume that, given α ∈ L, we can compute the roots in L of its minimal polynomial over Q and we can determine which roots are Aut(L)-conjugate to α. We prove there exists a pair of polynomials that characterizes the Aut(L)-conjugates of α, and that these polynomials can be effectively computed. Assume furthermore that L can be embedded in R, or in ...

This paper proposes a method for partitioning the vertex set of an undirected simple weighted graph into two subsets so as to minimise the diierence of vertex-weight sums between the two subsets and the total weight of edges cut (i.e., edges with one end in each subset). The proposed heuristic algorithm works in a divide-and-conquer fashion and is a modiication of an algorithm suggested in the ...

Let C be a finite set of n elements and R = {r1, r2, . . . , rm} a family of m subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each ri in X is an interval of P . A Minimal Conflicting Set (MCS) S ⊆ R is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a ne...

A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩Aj 6= ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a family of r-sets of an n element set containing no minimal k-cycle. Our results imply that for fixed r, k ≥ 3, ` ( n− 1 r − 1 ) +O(nr−2) ≤ fr(n, k) ≤ 3` ( n− 1 r − 1 ) +O(nr−2), where ` = b(k− 1)/2c. We also prove that fr(n,...