We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or all partial (3-valued) models are used we obtain

manuscript Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named jour-nal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication. Cutting planes algorithm for convex Generalized

. The purpose of this work is to clarify the relationship between three approaches to representing incomplete information in logic programming. Classical negation and epistemic disjunction are used in the first of these approaches, abductive logic programs with classical negation in the second

for making constraint solvers cooperate, and we present a scheduling application of the Dutch Railways and a new kind of algorithm for solving disjunctive programming problems, one which could not be developed without cooperating solvers. What emerges is that cooperating solvers, which have old roots

A Disjunctive Program (DP) is a mathematical program whose feasible region is the con-vex hull of the union of convex sets. The objective function is also convex. Disjunctive Pro-gramming models are very frequent as a modeling framework for setup costs or constraints, and models with constraints

We study an extension of disjunctive logic programs called set constraint disjunctive (SCD) programs where the clauses of the program are allowed to have a disjunction of monotone set constraints in their head and arbitrary monotone and antimonotone set constraints in their body. We introduce new

Abstract not found

that are expressed in algebraic form. The solution of MINLP problems with convex functions is presented first, followed by a brief discussion on extensions for the nonconvex case. The solution of logic based representations, known as generalized disjunctive programs, is also described. Theoretical properties

In the paper, we present a procedural semantics for fuzzy disjunctive programs with weak similarity - sets of graded strong literal disjunctions. We shall suppose that truth values (degrees) constitute a regular residuated lattice L = (L; , ; ),[;\;0; 1). A graded strong literal disjunction

This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based