… We address both of them, by (1) introducing a tool called Conditional Pure Literal Graph
and (2) showing its promising practical application in speeding up some refutation procedures. …

… This approach generalizes at once to obtain conditional maximum connectivities. We
illustrate with the values of the conditional line connectivities of complete graphs and complete …

… Suppose we are given a random B&W-graph G conditional that the number of its vertices is
given, and that for each vertex v, the w-degree of v as well as the number of black edges and …

… effects, our solution also decomposes each action with conditional effects into several …
of the given conditional effects. We characterise such a structure using a directed graph and …

In the random graph G (n, p) with pn bounded, the degrees of the vertices are almost iid
Poisson random variables with mean ƒÉ:= p (n-1). Motivated by this fact, we introduce the …

… garded as achieved, conditionally, upon the later achievement of L. Both subgoals K and
M are now conditionally achieved subject to the later achievement of the first occurrence of …

… the objective function; (ii) define conditional constraints that ensure feasibility in all scenarios.
… Also, we present the conditional extension to the timetable global constraint. Experimental …

… by the literal graph above, but by the implication graph. The vertices of the implication graph
are again the 2n literals; … We can bound the conditional probabilities for these clauses using …

… , which breaks operators with conditional effects up into a number of … graph for each
possible world. The expansion phase of Graphplan is then the same as for a normal plan graph…

… Each node in the JT represents a clique in the CRF graph. Figure 2 shows the JT for the CRF
graph shown in Figure 1. It is the property of our CRF graph structure that it leads to a linear …