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 ...

This paper is devoted to the study of metric subregularity constraint qualification for general optimization problems, with emphasis on nonconvex setting. We elaborate notions directional pseudo- and quasi-normality, recently introduced by Bai et al., which combine standard approach via quasi-normality modern tools variational analysis. focus applications disjunctive programs, where (directiona...

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive De-ductive Databases. While the semantics of non-disjunctive programs is fairly well understood the declarative and computational foundations of disjunctive programming proved to be much more elusive and diicult. Quite recently, two new and very promising semantics have b...

Most existing planners intertwine the refinement of a partial plan with search by pushing the individual refinements of a plan into different search branches. Although this approach reduces the cost of handling partial plans, it also often leads to search space explosion. In this paper, we consider the possibility of handling the refinements of a partial plan together (without splitting them in...

Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...

In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based on hyperresolution is introduced which extends Minker’s operator for positive disjunctive Datalog rules. In contrast to already existing model generation methods our approach for efficiently computing perfect models ...

We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages’ theorem are extended to disju...

The propositional μ-calculus as introduced by Kozen in [4] is considered. The notion of disjunctive formula is defined and it is shown that every formula is semantically equivalent to a disjunctive formula. For these formulas many difficulties encountered in the general case may be avoided. For instance, satisfiability checking is linear for disjunctive formulas. This kind of formula gives rise...

The semantics of disjunctive logic programs is based on minimal models. This makes atoms appearing in a disjunctive program false by default. In many cases this is highly desirable, but certain problems become awkward to formalize if all atoms are subject to minimization. Lifschitz’s parallel circumscription enables the use of varying and fixed atoms which eases the task of knowledge presentati...