: The article is devoted to the development of knowledge-oriented models that are able to increase the efficiency and quality of main pipeline complex (MPC) dispatching control. Th...
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...