We introduce a formal structure for dynamic programming that associates a unique dynamic programming functional equation to every deterministic, separable decision tree representation of the underlying problem. Since, in general, the computational complexity of the resulting functional equation depends on the decision tree chosen, the art of dynamic programming is shown to lie in the choice of ...

We extend answer set programming of dynamical systems with more expressive programming constructs such sequence, conditional, loop, non-deterministic choice of actions/arguments, and procedures. We discuss its relevance to the problem of answer set planning. We present an SMODELS encoding of these constructs and formally prove the correctness of our encoding.

This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic and stochastic cases using linear 0–1 programming techniques. Equivalent formulations are developed in terms of cardinality constraints. We conducted numerical case studies and analyzed the performance of optimization...

It has been shown that the problem of deterministically classifying constraints in semidefinite programming (SDP) is NP complete. An SDP is constructed that makes it possible to extend some constraint classification results from linear programming (LP) to SDP. Necessary and sufficient conditions for constraint classification, and ultimately, a deterministic method for detecting such are applied...

This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for a logic programming langua...

Truckload routing has always been a challenge. The truckload routing problem (TRP) itself is hard, but the complexity of solving the problem increases due to the stochastic nature of truckload demand. It is traditionally approached through the use of single objective solution methodologies which range from linear programming to dynamic programming techniques. This paper presents a deterministic...

This paper describes an experiment in programming part of an operating system kernel using the Esterel synchronous programming language. Using a synchronous programming language allows the construction of provable, deterministic reactive systems. The paper describes and analyzes the small executive realized and the formal veri cation of some of its properties. It also presents how multiple inte...

This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...

We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as finite-state process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. Dedicated to Zohar Manna for his 2th birthday