The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f where f is a general Boolean function represented by CNF [4]. The DNF formula φ of f is easily obtained by De Morgan’s la...

We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone orthogonal polygons. We show that every monotone polygon on n vertices can be...

We shall consider slightly more general problems. Namely, we shall investigate the existence of continuous: piecewise monotone, piecewise strictly monotone, and piecewise linear n-th roots of interval maps which have a continuous n-th root. Here by an n-th root of f we mean a map g such that f = g (g is the n-th iterate of g). A continuous map f : I → J , where I, J are closed intervals, is pie...

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or globally subanalytic sets. A monotone map is a multi-dimensional generalization of a usual univariate monotone continuous function on an open interval, while the closure of the graph of a monotone map is a generalization of a compact convex set. In a particular case of an identically con...

plexity method is not well suited to resolving this question. On the other hand, Razborov's approximation method also does not seem suitable, since so far it has been applied mainly to prove superpolynomial bounds for monotone circuits, while U C O N N , can be computed by polynomial-size monotone circuits. We show that any monotone circuit for computing graph connectivity must have a depth gre...

In [1] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals (e.g., real semialgebraic or subanalytic sets), and having connected intersections with all translated coordinate cones in Rn. In this paper we develop this theory further by defining monotone functions and maps, and studying their fundamental geometric properties. We prove several equ...

Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...

Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...

Interval-valued intuitionistic fuzzy sets (IVIFSs), a generalization of fuzzy sets, is characterized by an interval-valued membership function, an interval-valued non-membership function.The objective of this paper is to deal with criteria aggregation problems using IVIFSs where there exists a prioritization relationship over the criteria.Based on the ${L}$ukasiewicz triangular norm, we first p...