A set D of vertices in G is a disjunctive dominating if every vertex not adjacent to or has at least two distance 2 from it G. The domination number, γ2d(G), the minimum cardinality In this paper, we show that be graph order 3, δ(G)≥2 and with no component isomorphic any eight forbidden graphs, then γ2d(G)≤|G|3. Moreover, provide an infinite family graphs attaining bound. addition, also study c...

The paper presents a variable elimination method for computing the probability of a cnf query over a belief network. We present a bucket-elimination algorithm whose complexity is controlled by the induced-width of the moral graph combined with the interaction graph of the cnf. We show that the algorithm can be easily extended to answer a host of additional cnf-related queries such as nding the ...

This paper addresses the scheduling problem in a job-shop where the jobs have to be transported between the machines by several transport robots. The problem can be efficiently modeled by a disjunctive graph and any solution can be fully defined by an orientation of the graph. The objective is to determine a schedule of machine and transport operations as well as an assignment of robots to tran...

In this paper we present a method for modeling and managing various constraints encountered in task scheduling problems. Our approach aims at characterizing feasible schedules through the analysis of the set of constraints and their interaction, regardless to any optimization criteria. This analysis is achieved by a constraint propagation process on a constraint graph and produces both restrict...

Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a varian...

Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a varian...

Some kinds of decompositions of r-disjunctive languages on an arbitrary alphabet will be investigated. We will show that an f-disjunctive (t-disjunctive) language can be divided into two parts and either one part of them is an f-disjunctive (t-disjunctive) language or both parts are r-disjunctive but not f-disjunctive (t-disjunctive) languages. Finally, a relevant result of H. J. Shyr and S. S....

The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonly used to try to improve heuristic estimates. The first is disjunction: taking the maximum across several heuristic values. The second is the use of additive techniques, taking the sum of the heuristic values from a se...

This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal...

Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching for parallel solutions in state space planners would require the planners to branch on all possible subsets of parallel actions, thus increasing the branching factor exponentially. We present a varian...