Abstract The paper introduces a new type of rules into Natural Deduction, elimination by composition. Elimination composition replace usual in the style disjunction and give more direct treatment additive disjunction, multiplicative conjunction, existence quantifier possibility modality. have an enormous impact on proof-structures deductions: they do not produce segments, deduction trees remain...

Two major mechanisms responsible for chromosome segregation errors are non-disjunction and chromosome loss, both leading to aneuploidy. Previous studies in our laboratory showed the existence of thresholds for the induction of chromosome non-disjunction and chromosome loss and the induction of apoptosis by microtubule inhibitors. From a mechanistic point of view one can expect that apoptosis co...

In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of sel...

This paper is a contribution to the study of the rôle of disjunction in Abstract Algebraic Logic. Several kinds of (generalized) disjunctions, usually defined using a suitable variant of the proof by cases property, were introduced and extensively studied in the literature mainly in the context of finitary logics. The goals of this paper are to extend these results to all logics, to systematize...

Branching is an important component of the branch-and-cut algorithm for solving mixed integer linear programs. Most solvers branch by imposing a disjunction of the form“xi ≤ k ∨ xi ≥ k + 1” for some integer k and some integer-constrained variable xi. A generalization of this branching scheme is to branch by imposing a more general disjunction of the form “πx ≤ π0 ∨ πx ≥ π0 + 1.” In this paper, ...

Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...

This paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive disjunction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunction and shaving, another technique already u...