To bear in mind: There are MANY environments in which or gives rise to nondisjunctive readings: (5) Jane is taller than Bill or Sue. (6) The book is available in English or Spanish. (7) I want to go to a concert or an opera. (8) If you fly to Australia or Japan you’ll earn lots of frequent flyer miles. (Thanks to Carlos Fasola for examples.) The puzzles (i) Semantics: non-disjunctive reading of...

This article investigates cutting planes for mixed-integer disjunctive programs. In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. For disjunctions arising from binary variables, it is known that these cutting planes are essentially the same as Gomory mixed-integer and mixed-integer rounding cuts. In this article, we investigate ...

-In this paper we consider a technique for pattern classification based upon the development of prototypes which capture the distinguishing features ("disjunctive prototypes") of each pattern class and, via cross-correlation with incoming test images, enable efficient pattern classification. We evaluate such a classification procedure with prototypes based on the images per se (direct code), Ga...

We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog. Markability naturally extends to SHI ontologies, and markable onto...

We present an alternative characterization of disjunctive logic programs. We rst review Inheritance near-Horn Prolog (InH-Prolog), an intuitive and computationally eeective procedure that extends Prolog using case-analysis. We then describe a xpoint characterization of disjunctive logic programs that is similarly based on case-analysis. This xpoint characterization closely corresponds to the In...

How can we find the deepest disjunctive cut in some direction by using lift-and-project? We introduce the Reverse Polar Cut Generating Linear Program (RP-CGLP), which evaluates disjunctive cuts according to their slack for a point p in the disjunctive hull when having the same violation with respect to the fractional solution x' being separated. We show that the resulting cut defines a supporti...

We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric pointbased constraints, where each disjunct in each input disjunctive constraint is univocally associated to a l...

A disjunctive logic program under the answer set semantics can be equivalently translated to a normal logic program by the shifting transformation, if the program is head-cycle-free. In this paper, we provide an answer-set-preserving rewriting of a general disjunctive program to a normal program by first applying the unfolding transformation on atoms that prevent the program from being headcycl...

A sequence over an alphabet Σ is called disjunctive [13] if it contains all possible finite strings over Σ as its substrings. Disjunctive sequences have been recently studied in various contexts, e.g. [12, 9]. They abound in both category and measure senses [5]. In this paper we measure the complexity of a sequence x by the complexity of the language P (x) consisting of all prefixes of x. The l...

This paper describes techniques for the representation and efficient unification of feature structures in the presence of disjunctive information. For the specification of feature structures we introduce feature terms which may contain sorts, variables, negation and named disjunction. Disjunction names allow for a compact representation and efficient management of multiple solutions even in cas...