Disjunctive constraints are widely used to ensure that the time intervals over which two activities require the same resource do not overlap in time. Two types of extensions of disjunctive constraints are proposed: (1) extensions allowing the representation of more complex constraints including activities that may or may not require the resource, \state resources" to represent activities which ...

We identify three classes of four-state paraconsistent logics according to their different approaches towards the disjunctive syllogism, and investigate three representatives of these approaches: Quasiclassical logic, which always accepts this principle, Belnap’s logic, that rejects the disjunctive syllogism altogether, and a logic of inconsistency minimization that restricts its application to...

In this paper we present a framework to generate tight convex relaxations for nonconvex generalized disjunctive programs. The proposed methodology builds on our recent work on bilinear and concave generalized disjunctive programs for which tight linear relaxations can be generated, and extends its application to nonlinear relaxations. This is particularly important for those cases in which the ...

We consider the partial stable model semantics for disjunctive databases with default negation as deened by Przymusinski. We give a characterization of the partial stable models of a disjunctive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undee...

In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics de-ned originally by Gelfond and Lifschitz GL88]. In this paper we describe a procedure to compute the collection of all partial stable models of an extended disjunctive logic program. This procedure consists in transforming an extended disjunctive logic progra...