Issue No. 02 - March/April (1999 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.761663
<p><b>Abstract</b>—Dynamic programming is a general technique for solving optimization problems. It is based on the division of problems into simpler subproblems that can be computed separately. In this paper, we show that Datalog with aggregates and other nonmonotonic constructs can express classical dynamic programming optimization problems in a natural fashion, and then we discuss the important classes of queries and applications that benefit from these techniques.</p>
Deductive databases, nonmonotonic reasoning, aggregates, optimization.
S. Greco, "Dynamic Programming in Datalog with Aggregates," in IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 265-283, 1999.