Disjunctive logic programming under the stable model semantics [GL91] is a new methodology called answer set programming (ASP) for solving combinatorial search problems. This programming method uses answer set solvers, such as DLV [Lea05], GNT [Jea05], SMODELS [SS05], ASSAT [LZ02], CMODELS [Lie05a]. Systems DLV and GNT are more general as they work with the class of disjunctive logic programs, ...

Nonlinear disjunctive convex sets arise naturally in the formulation or solution methods of many discrete-continuous optimization problems. Often, a tight representation of the disjunctive convex set is sought, with the tightest such representation involving the characterization of the convex hull of the disjunctive convex set. In the most general case, this can be explicitly expressed through ...

Building on earlier work by Guo-Qiang Zhang on disjunctive information systems, and by Thomas Ehrhard, Pasquale Malacaria, and the first author on stable Stone duality, we develop a framework of disjunctive propositional logic in which theories correspond to algebraic L-domains. Disjunctions in the logic can be indexed by arbitrary sets (as in geometric logic) but must be provably disjoint. Thi...

Abductive logic programming (ALP) and disjunctive logic programming (DLP) are two different extensions of logic programming. This paper investigates the relationship between ALP and DLP from the program transformation viewpoint. It is shown that the belief set semantics of an abductive program is expressed by the answer set semantics and the possible model semantics of a disjunctive program. In...

Nowadays, many real problems can be modelled as Constraint Satisfaction Problems (CSPs). Some CSPs are considered nonbinary disjunctive CSPs. Many researchers study the problems of deciding consistency for Disjunctive Linear Relations (DLRs). In this paper, we propose a new class of constraints called Extended DLRs consisting of disjunctions of linear inequalities, linear disequations and non-l...

We define the inverse operation for disjunctive completion, introducing the notion of least disjunctive basis for an abstract domain D: this is the most abstract domain inducing the same disjunctive completion as D. We show that the least disjunctive basis exists in most cases, and study its properties in relation with reduced product of abstract interpretations. The resulting framework is powe...

In a recent paper [Paths, trees and matchings under disjunctive constraints, Darmann et. al., Discr. Appl. Math., 2011] the authors add to a graph G a set of conflicts, i.e. pairs of edges of G that cannot be both in a subgraph of G. They proved hardness results on the problem of constructing minimum spanning trees and maximum matchings containing no conflicts. A forbidden transition is a parti...

This paper considers the problem of containment of conjunctive queries CQ with disjunctive integrity constraints Query containment problem in the pres ence of integrity constraints has been studied broadly especially with functional and inclusion dependencies However to handle incomplete information in the database disjunctions are needed to be expressed as integrity constraints In this paper w...

This paper considers the problem of containment of conjunctive queries (CQ) with disjunctive integrity constraints. Query containment problem in the presence of integrity constraints has been studied broadly, especially with functional and inclusion dependencies. However, to handle incomplete information in the database, disjunctions are needed to be expressed as integrity constraints. In this ...

The modern development of seismic fieldwork technologies and data processing interpretation techniques make it possible to obtain high-quality material not only for studying structural features, but also in-depth analysis rock anisotropy: a detailed understanding the spatial heterogeneity lithological petrophysical properties, predicting nature fluid saturation, analyzing finely disjunctive tec...